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 listAug 1, 2026 13:49George SeabridgeGeorge SeabridgeScore: 6,855Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 13:496,80366,425,01255,460,0001,011,0002,113,536
2Aug 1, 2026 13:496,81366,524,39955,546,0001,007,0002,113,536
3Aug 1, 2026 13:496,81666,572,83755,490,0001,087,0002,113,536
4Aug 1, 2026 13:496,81666,508,01755,494,0001,080,0002,113,536
5Aug 1, 2026 13:496,85566,875,05655,629,0001,268,0002,113,536
6Aug 1, 2026 13:497,04768,436,96857,476,0001,017,0002,113,536
7Aug 1, 2026 13:498,14177,574,72866,554,0001,020,0002,113,536
8Aug 1, 2026 13:498,14777,585,64166,530,0001,092,0002,113,536
9Aug 1, 2026 13:498,17177,807,30866,726,0001,100,0002,113,536