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 10, 2026 03:54Josu San MartinJosu San MartinScore: 4,437Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 03:544,42653,911,85435,685,0001,053,0002,478,080
2May 10, 2026 03:544,42854,676,87735,691,0001,068,0002,478,080
3May 10, 2026 03:544,43052,684,44135,728,0001,047,0002,486,272
4May 10, 2026 03:544,43552,113,65135,787,0001,027,0002,494,464
5May 10, 2026 03:544,43756,140,77435,770,0001,059,0002,486,272
6May 10, 2026 03:544,44054,986,64835,802,0001,058,0002,486,272
7May 10, 2026 03:544,44652,474,36135,867,0001,035,0002,490,368
8May 10, 2026 03:544,44654,648,54235,827,0001,075,0002,486,272
9May 10, 2026 03:544,44755,360,35035,851,0001,065,0002,490,368