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 15, 2026 13:30Victor MerckléVictor MerckléScore: 6,967Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 13:306,96465,308,88057,802,00002,113,536
2May 15, 2026 13:306,96565,143,46657,813,00002,113,536
3May 15, 2026 13:306,96566,973,34957,810,00002,113,536
4May 15, 2026 13:306,96668,131,58457,819,00002,113,536
5May 15, 2026 13:306,96767,202,13756,809,0001,024,0002,113,536
6May 15, 2026 13:306,96765,259,87956,814,0001,013,0002,113,536
7May 15, 2026 13:306,96768,458,86657,833,00002,113,536
8May 15, 2026 13:306,97267,036,57256,824,0001,046,0002,113,536
9May 15, 2026 13:306,99265,487,07157,023,0001,017,0002,113,536