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 3, 2026 20:14Josu San MartinJosu San MartinScore: 15,286Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 20:1415,109134,771,482121,952,0003,453,0002,113,536
2Jul 3, 2026 20:1415,190135,489,897122,596,0003,489,0002,113,536
3Jul 3, 2026 20:1415,197135,509,014122,732,0003,405,0002,113,536
4Jul 3, 2026 20:1415,235135,776,311123,030,0003,426,0002,113,536
5Jul 3, 2026 20:1415,286136,296,365123,479,0003,399,0002,113,536
6Jul 3, 2026 20:1415,339136,712,267123,876,0003,443,0002,113,536
7Jul 3, 2026 20:1415,388137,120,543124,279,0003,442,0002,113,536
8Jul 3, 2026 20:1415,396137,190,079124,381,0003,414,0002,113,536
9Jul 3, 2026 20:1415,506137,992,086125,323,0003,382,0002,113,536