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 21, 2026 03:46Andrew EpsteinAndrew EpsteinScore: 4,012Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2026 03:473,90942,306,49930,180,0002,267,0002,113,536
2Aug 21, 2026 03:473,93242,514,97430,351,0002,287,0002,113,536
3Aug 21, 2026 03:473,94342,517,70230,482,0002,250,0002,113,536
4Aug 21, 2026 03:473,96142,764,22630,599,0002,281,0002,113,536
5Aug 21, 2026 03:474,01243,007,81331,022,0002,285,0002,113,536
6Aug 21, 2026 03:474,04743,304,60031,340,0002,253,0002,113,536
7Aug 21, 2026 03:474,06043,458,83231,418,0002,283,0002,113,536
8Aug 21, 2026 03:474,12644,079,42431,997,0002,251,0002,113,536
9Aug 21, 2026 03:474,12944,339,50431,948,0002,324,0002,113,536