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 09:58CheckHarryCheckHarryScore: 4,741Success
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 09:584,72749,014,65538,215,0001,025,0002,113,536
2Sep 3, 2026 09:584,73550,318,37838,281,0001,026,0002,113,536
3Sep 3, 2026 09:584,73649,137,69338,287,0001,026,0002,113,536
4Sep 3, 2026 09:584,73749,178,21938,295,0001,026,0002,113,536
5Sep 3, 2026 09:584,74149,100,58538,330,0001,026,0002,113,536
6Sep 3, 2026 09:584,74549,278,19938,362,0001,026,0002,113,536
7Sep 3, 2026 09:584,77049,412,00037,589,0002,006,0002,113,536
8Sep 3, 2026 09:584,79049,587,15638,731,0001,026,0002,113,536
9Sep 3, 2026 09:584,92350,776,81638,848,0002,018,0002,113,536