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 14, 2026 08:54Victor MerckléVictor MerckléScore: 60,490Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 08:5560,344508,164,202498,839,0002,023,0002,117,632stderr
2May 14, 2026 08:5560,440509,060,388499,535,0002,122,0002,117,632stderr
3May 14, 2026 08:5560,449510,861,406499,562,0002,165,0002,117,632stderr
4May 14, 2026 08:5560,480510,133,022499,901,0002,084,0002,117,632stderr
5May 14, 2026 08:5560,490510,068,032499,907,0002,166,0002,117,632stderr
6May 14, 2026 08:5560,525514,467,873500,356,0002,003,0002,117,632stderr
7May 14, 2026 08:5560,563510,167,674500,581,0002,095,0002,117,632stderr
8May 14, 2026 08:5560,564512,970,886500,576,0002,107,0002,117,632stderr
9May 14, 2026 08:5560,669512,037,882501,427,0002,128,0002,117,632stderr