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 15:31Kevin HeaveyKevin HeaveyScore: 3,806Success
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 15:343,52540,019,65428,062,0001,203,0002,113,536
2Sep 6, 2026 15:343,52937,696,25228,106,0001,191,0002,113,536
3Sep 6, 2026 15:343,74143,241,76230,026,0001,030,0002,113,536
4Sep 6, 2026 15:343,80539,979,08530,411,0001,172,0002,113,536
5Sep 6, 2026 15:343,80639,775,08830,390,0001,201,0002,113,536
6Sep 6, 2026 15:343,82339,946,91330,532,0001,201,0002,113,536
7Sep 6, 2026 15:343,82940,282,50330,590,0001,197,0002,113,536
8Sep 6, 2026 15:343,84440,398,09230,713,0001,197,0002,113,536
9Sep 6, 2026 15:343,85540,749,34630,821,0001,177,0002,113,536