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 5, 2026 02:49FrederickFrederickScore: 10,356Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2026 02:5010,22495,411,90482,823,0002,037,0002,117,632
2Oct 5, 2026 02:5010,22896,614,82483,881,0001,013,0002,117,632
3Oct 5, 2026 02:5010,23295,357,85982,912,0002,020,0002,117,632
4Oct 5, 2026 02:5010,26995,741,69183,228,0002,008,0002,117,632
5Oct 5, 2026 02:5010,35696,394,35283,954,0002,004,0002,117,632
6Oct 5, 2026 02:5010,53498,089,32885,421,0002,019,0002,113,536
7Oct 5, 2026 02:5010,56798,224,51885,690,0002,019,0002,117,632
8Oct 5, 2026 02:5010,68599,668,23186,686,0002,003,0002,117,632
9Oct 5, 2026 02:5010,77799,965,29287,348,0002,107,0002,117,632