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 listJun 30, 2026 11:26Victor MerckléVictor MerckléScore: 4,173Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 11:274,15742,347,55633,456,0001,054,0002,117,632stderr
2Jun 30, 2026 11:274,15842,199,14233,409,0001,108,0002,117,632stderr
3Jun 30, 2026 11:274,15942,202,65633,467,0001,054,0002,117,632stderr
4Jun 30, 2026 11:274,16542,336,74233,461,0001,112,0002,117,632stderr
5Jun 30, 2026 11:274,17342,486,07733,543,0001,095,0002,117,632stderr
6Jun 30, 2026 11:274,20042,573,32633,822,0001,043,0002,117,632stderr
7Jun 30, 2026 11:274,27843,183,50534,417,0001,096,0002,117,632stderr
8Jun 30, 2026 11:274,28444,759,77334,541,0001,019,0002,117,632stderr
9Jun 30, 2026 11:274,29643,376,14534,560,0001,102,0002,117,632stderr