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 listFeb 25, 2026 19:50Daniel MastalerzDaniel MastalerzScore: 5,487Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 25, 2026 19:505,38574,547,21142,666,0002,031,0002,293,760
2Feb 25, 2026 19:505,39072,158,71342,746,0001,988,0002,293,760
3Feb 25, 2026 19:505,44766,873,37042,199,0003,014,0002,420,736
4Feb 25, 2026 19:505,48768,682,38143,515,0002,023,0002,420,736
5Feb 25, 2026 19:505,48768,083,99344,530,0001,012,0002,285,568
6Feb 25, 2026 19:505,49069,562,95743,541,0002,025,0002,412,544