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:59Karthik ReddyKarthik ReddyScore: 3,375Success
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 08:003,36836,967,29426,880,0001,078,0002,113,536
2Oct 1, 2026 08:003,36837,001,11826,862,0001,098,0002,113,536
3Oct 1, 2026 08:003,37436,909,21226,911,0001,101,0002,113,536
4Oct 1, 2026 08:003,37437,199,22426,896,0001,112,0002,113,536
5Oct 1, 2026 08:003,37537,017,00226,929,0001,091,0002,113,536
6Oct 1, 2026 08:003,38036,962,68626,961,0001,099,0002,113,536
7Oct 1, 2026 08:003,38237,132,82826,992,0001,085,0002,113,536
8Oct 1, 2026 08:003,38837,217,05026,966,0001,162,0002,113,536
9Oct 1, 2026 08:003,40337,368,79427,069,0001,181,0002,113,536