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 21, 2026 13:01Victor MerckléVictor MerckléScore: 4,677Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 13:024,63746,408,82437,407,0001,081,0002,113,536
2May 21, 2026 13:024,64648,319,51437,495,0001,075,0002,113,536
3May 21, 2026 13:024,65047,054,66537,531,0001,065,0002,113,536
4May 21, 2026 13:024,67146,597,99637,700,0001,070,0002,113,536
5May 21, 2026 13:024,67748,527,30637,798,0001,023,0002,113,536
6May 21, 2026 13:024,68646,737,91337,894,0001,004,0002,113,536
7May 21, 2026 13:024,68747,335,51337,784,0001,121,0002,113,536
8May 21, 2026 13:024,84748,056,05839,166,0001,068,0002,113,536
9May 21, 2026 13:024,86648,231,05739,250,0001,139,0002,113,536