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 08:41Karthik ReddyKarthik ReddyScore: 3,450Success
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:413,43637,519,16627,480,0001,042,0002,113,536
2Oct 1, 2026 08:413,43837,574,31027,483,0001,054,0002,113,536
3Oct 1, 2026 08:413,44737,621,21327,544,0001,068,0002,113,536
4Oct 1, 2026 08:413,44837,675,95427,565,0001,060,0002,113,536
5Oct 1, 2026 08:413,45037,689,16227,546,0001,092,0002,113,536
6Oct 1, 2026 08:413,46437,776,86427,592,0001,164,0002,113,536
7Oct 1, 2026 08:413,47037,830,54627,684,0001,118,0002,113,536
8Oct 1, 2026 08:413,47637,797,61727,707,0001,147,0002,113,536
9Oct 1, 2026 08:413,48137,866,17627,770,0001,124,0002,113,536