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 listAug 11, 2025 17:24Ian MckibbenIan MckibbenScore: 12,924Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2025 17:2412,885131,213,447104,945,0001,998,0002,531,328
2Aug 11, 2025 17:2512,901134,105,382106,075,0001,000,0002,433,024
3Aug 11, 2025 17:2512,916133,797,109105,198,0002,003,0002,531,328
4Aug 11, 2025 17:2412,924126,192,210107,267,00002,437,120
5Aug 11, 2025 17:2513,188132,293,821109,464,00002,531,328
6Aug 11, 2025 17:2413,192136,173,445109,493,00002,531,328