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 21, 2026 17:03Victor MerckléVictor MerckléScore: 4,638Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 17:044,61846,228,08637,330,0001,001,0002,113,536
2May 21, 2026 17:044,63246,282,36137,387,0001,063,0002,113,536
3May 21, 2026 17:044,63347,472,56437,461,0001,001,0002,113,536
4May 21, 2026 17:044,63648,295,20037,480,0001,003,0002,113,536
5May 21, 2026 17:044,63846,326,80737,478,0001,019,0002,113,536
6May 21, 2026 17:044,66348,701,79837,672,0001,035,0002,113,536
7May 21, 2026 17:044,70848,820,07038,048,0001,032,0002,113,536
8May 21, 2026 17:044,72047,456,21938,159,0001,023,0002,113,536
9May 21, 2026 17:044,85449,040,19539,260,0001,036,0002,113,536