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 9, 2026 06:21Milo PresedoMilo PresedoScore: 24,858Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 06:2224,051215,436,063198,616,0001,009,0002,367,488
2May 9, 2026 06:2224,054214,046,463198,641,0001,010,0002,367,488
3May 9, 2026 06:2224,477220,425,958202,152,0001,010,0002,367,488
4May 9, 2026 06:2224,855223,761,715205,290,0001,011,0002,375,680
5May 9, 2026 06:2224,858220,367,450205,316,0001,009,0002,326,528
6May 9, 2026 06:2224,858220,705,952205,317,0001,009,0002,371,584
7May 9, 2026 06:2224,859224,690,273205,322,0001,009,0002,371,584
8May 9, 2026 06:2224,860224,225,335205,328,0001,011,0002,367,488
9May 9, 2026 06:2224,864224,287,947205,361,0001,012,0002,367,488