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 02:51CheckHarryCheckHarryScore: 4,137Success
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 02:524,12344,092,09533,206,0001,022,0002,113,536
2Sep 6, 2026 02:524,12744,135,46433,239,0001,022,0002,113,536
3Sep 6, 2026 02:524,13044,212,13833,242,0001,044,0002,113,536
4Sep 6, 2026 02:524,13244,159,02533,273,0001,025,0002,113,536
5Sep 6, 2026 02:524,13744,219,14233,326,0001,015,0002,113,536
6Sep 6, 2026 02:524,14244,318,88633,343,0001,041,0002,113,536
7Sep 6, 2026 02:524,14544,327,80933,398,0001,010,0002,113,536
8Sep 6, 2026 02:524,15044,382,46733,444,0001,008,0002,113,536
9Sep 6, 2026 02:524,29145,490,13734,591,0001,031,0002,113,536