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 listMay 15, 2026 23:06Victor MerckléVictor MerckléScore: 6,951Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 23:066,94665,057,34256,638,0001,016,0002,113,536
2May 15, 2026 23:066,94766,411,08156,648,0001,013,0002,113,536
3May 15, 2026 23:066,95067,822,71256,657,0001,030,0002,113,536
4May 15, 2026 23:066,95067,920,56856,684,0001,005,0002,113,536
5May 15, 2026 23:066,95167,060,49356,674,0001,023,0002,113,536
6May 15, 2026 23:066,95267,776,84056,691,0001,015,0002,113,536
7May 15, 2026 23:066,95565,181,99556,715,0001,017,0002,113,536
8May 15, 2026 23:066,96765,167,93356,826,0001,006,0002,113,536
9May 15, 2026 23:067,00366,371,05357,121,0001,009,0002,113,536