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 20:02Victor MerckléVictor MerckléScore: 7,698Success
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 20:037,68874,167,89463,812,00002,113,536
2May 13, 2026 20:037,69771,267,36562,850,0001,039,0002,113,536
3May 13, 2026 20:037,69773,728,32362,888,0001,002,0002,113,536
4May 13, 2026 20:037,69773,235,47362,870,0001,018,0002,113,536
5May 13, 2026 20:037,69873,265,86862,894,0001,004,0002,113,536
6May 13, 2026 20:037,70173,170,89862,912,0001,009,0002,113,536
7May 13, 2026 20:037,71171,323,35763,000,0001,004,0002,113,536
8May 13, 2026 20:037,71672,401,55963,033,0001,015,0002,113,536
9May 13, 2026 20:037,80174,983,30963,716,0001,037,0002,113,536