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 listSep 17, 2026 00:43Andrew EpsteinAndrew EpsteinScore: 3,577Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 00:433,51939,407,41128,114,0001,100,0002,113,536
2Sep 17, 2026 00:433,52039,297,80328,109,0001,109,0002,113,536
3Sep 17, 2026 00:433,52839,498,99228,177,0001,111,0002,113,536
4Sep 17, 2026 00:433,56839,761,31628,513,0001,103,0002,113,536
5Sep 17, 2026 00:433,57739,830,12428,574,0001,123,0002,113,536
6Sep 17, 2026 00:433,62540,248,71228,987,0001,102,0002,113,536
7Sep 17, 2026 00:433,64340,393,93129,119,0001,120,0002,113,536
8Sep 17, 2026 00:433,64840,515,36029,181,0001,104,0002,113,536
9Sep 17, 2026 00:433,66241,725,02529,302,0001,098,0002,113,536