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 19, 2026 14:34Victor MerckléVictor MerckléScore: 167,062Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 14:37166,0621,386,748,2381,372,324,0005,994,0002,113,536
2May 19, 2026 14:37166,0771,386,948,0761,372,376,0006,070,0002,113,536
3May 19, 2026 14:37166,5131,391,916,8311,375,831,0006,235,0002,113,536
4May 19, 2026 14:37166,6331,391,204,5731,377,121,0005,938,0002,113,536
5May 19, 2026 14:37167,0621,394,507,7291,380,493,0006,124,0002,113,536
6May 19, 2026 14:37167,2681,399,216,7841,381,865,0006,463,0002,113,536
7May 19, 2026 14:37167,3211,400,433,7441,382,977,0005,792,0002,113,536
8May 19, 2026 14:37167,8911,402,253,7451,387,720,0005,780,0002,113,536
9May 19, 2026 14:37168,0681,404,776,0351,389,158,0005,808,0002,113,536