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 19, 2026 13:52lolrdor1gamerlolrdor1gamerScore: 61,200Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 13:5261,101530,205,790506,139,0001,000,0002,371,584
2Feb 19, 2026 13:5261,119533,816,323506,291,0001,000,0002,527,232
3Feb 19, 2026 13:5261,167533,252,216506,691,000999,0002,527,232
4Feb 19, 2026 13:5261,183536,826,814506,817,000999,0002,527,232
5Feb 19, 2026 13:5261,200536,356,912505,958,0001,999,0002,527,232
6Feb 19, 2026 13:5261,974540,592,247512,386,0001,997,0002,371,584
7Feb 19, 2026 13:5262,545542,365,960519,125,00002,527,232
8Feb 19, 2026 13:5262,560545,519,977519,248,00002,527,232
9Feb 19, 2026 13:5262,604544,650,837517,616,0001,998,0002,383,872