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 1, 2026 07:55Karthik ReddyKarthik ReddyScore: 3,372Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 1, 2026 07:553,36537,010,90826,832,0001,104,0002,113,536
2Oct 1, 2026 07:553,36636,972,75626,847,0001,097,0002,113,536
3Oct 1, 2026 07:553,37137,017,18026,896,0001,090,0002,113,536
4Oct 1, 2026 07:553,37136,997,02226,901,0001,086,0002,113,536
5Oct 1, 2026 07:553,37236,879,73426,902,0001,092,0002,113,536
6Oct 1, 2026 07:553,37537,074,09626,914,0001,105,0002,113,536
7Oct 1, 2026 07:553,40237,154,63127,068,0001,174,0002,113,536
8Oct 1, 2026 07:553,41237,334,04727,262,0001,060,0002,113,536
9Oct 1, 2026 07:553,45437,878,26627,584,0001,087,0002,113,536