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 listAug 27, 2026 08:52Victor MerckléVictor MerckléScore: 3,744Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 08:533,72139,267,73229,761,0001,127,0002,113,536
2Aug 27, 2026 08:533,72439,334,01729,772,0001,142,0002,113,536
3Aug 27, 2026 08:533,72439,421,12029,763,0001,152,0002,113,536
4Aug 27, 2026 08:533,73439,394,51729,917,0001,080,0002,113,536
5Aug 27, 2026 08:533,74439,434,48929,903,0001,173,0002,113,536
6Aug 27, 2026 08:533,75139,524,59430,035,0001,102,0002,113,536
7Aug 27, 2026 08:533,75239,540,01630,069,0001,080,0002,113,536
8Aug 27, 2026 08:533,75339,568,86230,021,0001,135,0002,113,536
9Aug 27, 2026 08:533,78839,826,37330,326,0001,120,0002,113,536