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 15, 2026 11:09boop34boop34Score: 14,439Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2026 11:1014,310129,046,807106,704,00012,076,00020,480
2Jul 15, 2026 11:1014,351128,792,514105,198,00013,917,00020,480
3Jul 15, 2026 11:1014,381129,766,430106,639,00012,726,00020,480
4Jul 15, 2026 11:1014,404129,230,426105,309,00014,252,00020,480
5Jul 15, 2026 11:1014,439129,567,388105,153,00014,692,00020,480
6Jul 15, 2026 11:1014,464130,329,986106,895,00013,157,00020,480
7Jul 15, 2026 11:1014,508130,784,850106,585,00013,834,00020,480
8Jul 15, 2026 11:1014,511130,668,978106,262,00014,181,00020,480
9Jul 15, 2026 11:1014,674131,490,996109,236,00012,559,00020,480