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 listFeb 7, 2026 17:12Benn TanBenn TanScore: 56,025Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 17:1255,938485,742,680462,283,0002,001,0002,269,184
2Feb 7, 2026 17:1255,947494,658,660463,360,0001,000,0002,396,160
3Feb 7, 2026 17:1256,016492,236,021461,932,0002,999,0002,269,184
4Feb 7, 2026 17:1256,021485,594,764463,973,000999,0002,269,184
5Feb 7, 2026 17:1256,025488,524,418462,010,0003,000,0002,392,064
6Feb 7, 2026 17:1256,038494,599,988465,118,00002,400,256
7Feb 7, 2026 17:1256,044488,220,626464,162,0001,000,0002,269,184
8Feb 7, 2026 17:1256,051491,494,246464,222,0001,000,0002,392,064
9Feb 7, 2026 17:1256,113495,705,009463,741,0001,998,0002,269,184