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 listApr 24, 2026 15:15Charles CabergsCharles CabergsScore: 19,946Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 15:1519,798183,340,879163,326,0001,002,0002,375,680
2Apr 24, 2026 15:1519,821182,045,630163,514,0001,003,0002,437,120
3Apr 24, 2026 15:1519,933181,554,697164,444,0001,002,0002,363,392
4Apr 24, 2026 15:1519,935188,564,083164,464,0001,002,0002,310,144
5Apr 24, 2026 15:1519,946185,393,651165,552,00002,371,584
6Apr 24, 2026 15:1520,696190,126,631170,779,000998,0002,306,048
7Apr 24, 2026 15:1520,698191,950,875169,801,0001,997,0002,359,296
8Apr 24, 2026 15:1520,702191,682,929169,830,0001,998,0002,355,200
9Apr 24, 2026 15:1520,725189,884,674170,024,0002,000,0002,289,664