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 listAug 17, 2026 19:49Navneet RajNavneet RajScore: 56,966Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 19:5355,665472,586,632460,941,0001,082,0002,113,536
2Aug 17, 2026 19:5356,781481,784,324470,184,0001,106,0002,113,536
3Aug 17, 2026 19:5356,897482,781,619470,984,0001,264,0002,113,536
4Aug 17, 2026 19:5356,944482,569,195471,573,0001,065,0002,113,536
5Aug 17, 2026 19:5356,966483,339,138471,666,0001,157,0002,113,536
6Aug 17, 2026 19:5356,971482,721,293471,745,0001,116,0002,113,536
7Aug 17, 2026 19:5356,984483,491,236471,968,0001,004,0002,113,536
8Aug 17, 2026 19:5356,989483,769,157471,779,0001,231,0002,113,536
9Aug 17, 2026 19:5357,178484,667,242472,565,0002,016,0002,113,536