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,094Success
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,08043,908,90932,849,0001,021,0002,113,536
2Sep 6, 2026 02:524,08643,806,24032,894,0001,021,0002,113,536
3Sep 6, 2026 02:524,08643,821,73132,894,0001,021,0002,113,536
4Sep 6, 2026 02:524,08845,319,23432,912,0001,019,0002,113,536
5Sep 6, 2026 02:524,09443,779,60132,971,0001,016,0002,113,536
6Sep 6, 2026 02:524,10944,015,08933,088,0001,019,0002,113,536
7Sep 6, 2026 02:524,11344,090,69532,948,0001,195,0002,113,536
8Sep 6, 2026 02:524,13044,193,14633,273,0001,009,0002,113,536
9Sep 6, 2026 02:524,13644,439,25133,318,0001,014,0002,113,536