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 3, 2026 03:51CheckHarryCheckHarryScore: 6,672Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 03:526,66465,353,02554,312,0001,007,0002,113,536
2Sep 3, 2026 03:526,66765,289,52354,333,0001,006,0002,113,536
3Sep 3, 2026 03:526,66865,194,11454,282,0001,063,0002,113,536
4Sep 3, 2026 03:526,67265,316,66554,338,0001,046,0002,113,536
5Sep 3, 2026 03:526,67265,197,53054,331,0001,047,0002,113,536
6Sep 3, 2026 03:526,67765,296,55654,239,0001,186,0002,113,536
7Sep 3, 2026 03:526,68665,365,04554,444,0001,055,0002,113,536
8Sep 3, 2026 03:526,70665,483,49554,654,0001,012,0002,113,536
9Sep 3, 2026 03:526,70765,545,31854,497,0001,172,0002,113,536