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 7, 2026 11:36Daniel MastalerzDaniel MastalerzScore: 46,104Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 11:3645,706401,800,381378,361,0001,000,0002,269,184
2Feb 7, 2026 11:3646,104413,104,346381,666,000999,0002,404,352
3Feb 7, 2026 11:3646,111416,111,573378,724,0003,997,0002,269,184