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 listAug 2, 2026 17:55boop34boop34Score: 9,239Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 17:559,22786,419,33775,399,0001,190,0002,113,536
2Aug 2, 2026 17:559,23286,462,90975,422,0001,210,0002,113,536
3Aug 2, 2026 17:559,23387,204,08775,428,0001,214,0002,113,536
4Aug 2, 2026 17:559,23486,501,35975,426,0001,218,0002,113,536
5Aug 2, 2026 17:559,23986,695,19675,450,0001,240,0002,113,536
6Aug 2, 2026 17:559,24486,963,40175,533,0001,199,0002,113,536
7Aug 2, 2026 17:559,26386,818,62775,671,0001,212,0002,113,536
8Aug 2, 2026 17:559,29687,108,06776,145,0001,017,0002,113,536
9Aug 2, 2026 17:559,38387,719,05376,750,0001,129,0002,113,536