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 listOct 2, 2026 18:10Karthik ReddyKarthik ReddyScore: 3,631Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 18:103,5803,038,837,51726,166,0003,555,00020,480
2Oct 2, 2026 18:103,6173,039,206,50726,203,0003,823,00020,480
3Oct 2, 2026 18:103,6193,039,149,31326,267,0003,774,00020,480
4Oct 2, 2026 18:103,6203,039,078,72326,374,0003,677,00020,480
5Oct 2, 2026 18:103,6313,039,269,90126,239,0003,900,00020,480
6Oct 2, 2026 18:103,6363,039,385,47526,203,0003,976,00020,480
7Oct 2, 2026 18:103,6413,039,378,88026,299,0003,929,00020,480
8Oct 2, 2026 18:103,6433,039,278,52726,378,0003,865,00020,480
9Oct 2, 2026 18:103,6443,039,375,35526,205,0004,048,00020,480