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 13, 2026 18:19Victor MerckléVictor MerckléScore: 236,742Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 18:20236,2661,968,513,4001,959,955,0001,056,0002,117,632stderr
2May 13, 2026 18:20236,2751,971,312,4961,959,939,0001,148,0002,117,632stderr
3May 13, 2026 18:20236,4431,971,690,3001,961,447,0001,031,0002,117,632stderr
4May 13, 2026 18:20236,6951,973,165,6651,963,482,0001,092,0002,117,632stderr
5May 13, 2026 18:20236,7421,973,838,9041,963,800,0001,165,0002,117,632stderr
6May 13, 2026 18:20236,8171,973,900,2591,964,433,0001,153,0002,117,632stderr
7May 13, 2026 18:20237,2821,977,753,3851,968,409,0001,035,0002,117,632stderr
8May 13, 2026 18:20237,3401,977,979,6761,968,856,0001,068,0002,117,632stderr
9May 13, 2026 18:20237,5381,980,705,1911,970,395,0001,177,0002,117,632stderr