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 5, 2026 11:54Kevin HeaveyKevin HeaveyScore: 22,135Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 11:5520,421179,084,193168,359,0001,137,0002,117,632
2Jul 5, 2026 11:5520,433179,086,379168,420,0001,176,0002,117,632
3Jul 5, 2026 11:5522,135193,174,514182,599,0001,127,0002,117,632
4Jul 5, 2026 11:5522,135193,190,291182,579,0001,142,0002,117,632
5Jul 5, 2026 11:5522,135193,160,882182,598,0001,127,0002,117,632
6Jul 5, 2026 11:5522,139193,290,615182,624,0001,131,0002,117,632
7Jul 5, 2026 11:5522,146193,257,699182,670,0001,147,0002,117,632
8Jul 5, 2026 11:5522,152193,365,347182,710,0001,158,0002,117,632
9Jul 5, 2026 11:5522,165193,494,899182,791,0001,184,0002,117,632