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 15, 2026 20:26Juraj ZelmanJuraj ZelmanScore: 12,580Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 20:2612,503132,192,524101,784,0001,995,0002,281,472
2Feb 15, 2026 20:2612,580128,710,033103,411,0001,003,0002,277,376
3Feb 15, 2026 20:2612,651133,945,385104,003,0001,000,0002,523,136