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 listJan 22, 2026 21:01lipapipalipapipaScore: 49,864Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 22, 2026 21:0248,415434,736,424399,846,0001,999,0002,269,184
2Jan 22, 2026 21:0249,847440,980,509411,734,0001,998,0002,387,968
3Jan 22, 2026 21:0249,861439,730,076411,849,0001,999,0002,392,064
4Jan 22, 2026 21:0149,864439,936,209411,873,0001,999,0002,404,352
5Jan 22, 2026 21:0149,923440,065,069411,366,0002,995,0002,269,184
6Jan 22, 2026 21:0150,053450,279,534414,443,0001,001,0002,400,256