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 listJul 16, 2026 07:43wnwnScore: 3,546Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2026 07:433,51337,269,34728,130,0001,028,0002,113,536
2Jul 16, 2026 07:433,51737,142,10028,192,0001,006,0002,113,536
3Jul 16, 2026 07:433,53437,359,13128,314,0001,024,0002,113,536
4Jul 16, 2026 07:433,54637,428,38028,430,0001,006,0002,113,536
5Jul 16, 2026 07:433,54637,343,07528,438,0001,002,0002,113,536
6Jul 16, 2026 07:433,55237,400,68428,462,0001,027,0002,113,536
7Jul 16, 2026 07:433,55237,588,91028,475,0001,010,0002,113,536
8Jul 16, 2026 07:433,55437,536,52128,465,0001,037,0002,113,536
9Jul 16, 2026 07:433,55737,447,94628,507,0001,024,0002,113,536