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 01:48Andrew EpsteinAndrew EpsteinScore: 6,947Success
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 01:486,83366,711,29455,575,0001,141,0002,117,632stderr
2Sep 17, 2026 01:486,92067,527,95056,301,0001,139,0002,117,632stderr
3Sep 17, 2026 01:486,92067,491,72756,296,0001,140,0002,117,632stderr
4Sep 17, 2026 01:486,93367,703,82856,378,0001,172,0002,117,632stderr
5Sep 17, 2026 01:486,94768,569,53756,507,0001,154,0002,117,632stderr
6Sep 17, 2026 01:486,95868,555,03256,617,0001,137,0002,117,632stderr
7Sep 17, 2026 01:486,97668,180,05156,754,0001,148,0002,117,632stderr
8Sep 17, 2026 01:486,98768,093,56156,868,0001,130,0002,117,632stderr
9Sep 17, 2026 01:487,01268,436,19157,054,0001,147,0002,117,632stderr