Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listDec 26, 2025 18:34hunaphuhunaphuScore: 61,704Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 26, 2025 18:3461,310534,312,864506,877,0001,999,0002,269,184
2Dec 26, 2025 18:3461,490540,773,778509,364,0001,000,0002,269,184
3Dec 26, 2025 18:3461,571531,774,789509,041,0002,000,0002,269,184
4Dec 26, 2025 18:3461,595535,681,562511,236,00002,510,848
5Dec 26, 2025 18:3461,704534,789,268512,142,00002,269,184
6Dec 26, 2025 18:3463,172545,879,587519,323,0005,003,0002,269,184
7Dec 26, 2025 18:3463,318549,563,508524,542,000999,0002,392,064
8Dec 26, 2025 18:3464,521562,730,011534,522,000999,0002,269,184
9Dec 26, 2025 18:3464,530565,942,592534,598,000999,0002,269,184