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 30, 2026 19:10Josu San MartinJosu San MartinScore: 4,335Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 19:124,31144,283,90134,727,0001,057,0002,113,536
2Aug 30, 2026 19:124,32545,983,89134,847,0001,055,0002,113,536
3Aug 30, 2026 19:124,32744,282,43734,875,0001,041,0002,113,536
4Aug 30, 2026 19:124,33344,422,21134,861,0001,109,0002,113,536
5Aug 30, 2026 19:124,33544,394,44134,932,0001,055,0002,113,536
6Aug 30, 2026 19:124,35144,567,05934,991,0001,129,0002,113,536
7Aug 30, 2026 19:124,35644,592,23235,042,0001,113,0002,113,536
8Aug 30, 2026 19:124,48245,618,36236,093,0001,114,0002,113,536
9Aug 30, 2026 19:124,53246,025,47536,570,0001,049,0002,113,536