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 6, 2026 03:31CheckHarryCheckHarryScore: 4,000Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 03:323,97442,879,55331,976,0001,010,0002,113,536
2Sep 6, 2026 03:323,98543,051,11032,070,0001,013,0002,113,536
3Sep 6, 2026 03:323,98743,044,42632,081,0001,019,0002,113,536
4Sep 6, 2026 03:323,98843,001,73432,096,0001,009,0002,113,536
5Sep 6, 2026 03:324,00043,179,28632,196,0001,010,0002,113,536
6Sep 6, 2026 03:324,00343,071,50232,218,0001,009,0002,113,536
7Sep 6, 2026 03:324,00643,090,05732,220,0001,035,0002,113,536
8Sep 6, 2026 03:324,06444,834,09932,707,0001,031,0002,113,536
9Sep 6, 2026 03:324,09443,860,85332,973,0001,014,0002,113,536