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 16, 2026 10:04tch1001tch1001Score: 64,787Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 10:0464,767563,947,662536,566,000999,0002,273,280
2Feb 16, 2026 10:0464,774567,918,748536,624,000999,0002,273,280
3Feb 16, 2026 10:0464,786564,383,157535,727,0001,998,0002,404,352
4Feb 16, 2026 10:0464,786567,110,482535,724,0001,998,0002,273,280
5Feb 16, 2026 10:0464,787570,688,497536,732,000999,0002,273,280
6Feb 16, 2026 10:0464,787563,284,802534,738,0002,998,0002,400,256
7Feb 16, 2026 10:0464,789563,009,954536,749,000999,0002,400,256
8Feb 16, 2026 10:0464,807564,143,412535,900,0001,999,0002,396,160
9Feb 16, 2026 10:0464,808563,459,827535,905,0001,999,0002,514,944