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 02:43Andrew EpsteinAndrew EpsteinScore: 4,051Success
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 02:443,91042,236,95830,178,0002,283,0002,113,536
2Aug 21, 2026 02:443,93942,418,49230,377,0002,323,0002,113,536
3Aug 21, 2026 02:443,99742,997,51330,894,0002,285,0002,113,536
4Aug 21, 2026 02:444,03743,285,92831,249,0002,265,0002,113,536
5Aug 21, 2026 02:444,05143,398,00331,298,0002,328,0002,113,536
6Aug 21, 2026 02:444,05143,507,02231,357,0002,273,0002,113,536
7Aug 21, 2026 02:444,07643,617,54131,559,0002,278,0002,113,536
8Aug 21, 2026 02:444,07943,677,98931,582,0002,276,0002,113,536
9Aug 21, 2026 02:444,09043,763,47831,679,0002,273,0002,113,536