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 17, 2026 23:57avoidcatenjoyersavoidcatenjoyersScore: 89,060Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 00:0388,924747,578,690680,114,00057,958,0002,113,536
2May 18, 2026 00:0388,964747,748,804679,929,00058,478,0002,113,536
3May 18, 2026 00:0388,983748,166,735679,663,00058,903,0002,113,536
4May 18, 2026 00:0389,019748,151,615680,136,00058,726,0002,113,536
5May 18, 2026 00:0389,060751,375,202680,381,00058,817,0002,113,536
6May 18, 2026 00:0389,067750,649,158680,048,00059,216,0002,113,536
7May 18, 2026 00:0389,072749,165,927680,040,00059,262,0002,113,536
8May 18, 2026 00:0389,086748,703,037679,906,00059,514,0002,113,536
9May 18, 2026 00:0389,093751,384,120680,121,00059,358,0002,113,536