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 listMar 14, 2026 21:18Ondřej PolaneckýOndřej PolaneckýScore: 45,228Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 21:1845,195402,399,488374,120,0001,000,0002,273,280
2Mar 14, 2026 21:1845,210403,531,630374,246,0001,000,0002,404,352
3Mar 14, 2026 21:1845,213399,605,943374,272,0001,000,0002,273,280
4Mar 14, 2026 21:1845,219400,936,077375,320,00002,273,280
5Mar 14, 2026 21:1845,228403,477,508375,393,00002,396,160
6Mar 14, 2026 21:1845,230401,298,514375,405,00002,273,280
7Mar 14, 2026 21:1845,237397,229,438374,466,000998,0002,273,280
8Mar 14, 2026 21:1845,246401,412,408374,540,000998,0002,273,280
9Mar 14, 2026 21:1845,256402,901,738374,625,000999,0002,387,968