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 24, 2026 13:45SneedSneedScore: 67,037Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 13:4567,009586,639,894555,173,0001,000,0002,527,232
2Feb 24, 2026 13:4567,037583,760,627556,411,00002,531,328
3Feb 24, 2026 13:4567,070582,419,677554,687,0001,998,0002,523,136