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 23:27Victor MerckléVictor MerckléScore: 7,612Success
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 23:277,57072,267,46861,796,0001,043,0002,113,536
2May 13, 2026 23:277,57071,118,17162,831,00002,113,536
3May 13, 2026 23:277,57070,596,86261,833,0001,002,0002,113,536
4May 13, 2026 23:277,59373,408,43562,004,0001,020,0002,113,536
5May 13, 2026 23:277,61272,146,33163,181,00002,113,536
6May 13, 2026 23:277,63671,080,91963,385,00002,113,536
7May 13, 2026 23:277,64972,929,12962,467,0001,021,0002,113,536
8May 13, 2026 23:277,71471,278,69563,026,0001,001,0002,113,536
9May 13, 2026 23:277,71673,037,28764,045,00002,113,536