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 31, 2026 01:43Josu San MartinJosu San MartinScore: 4,236Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 01:474,22543,491,05034,029,0001,043,0002,113,536
2Aug 31, 2026 01:474,23143,565,97134,083,0001,035,0002,113,536
3Aug 31, 2026 01:474,23343,592,72234,108,0001,029,0002,113,536
4Aug 31, 2026 01:474,23443,614,50934,114,0001,029,0002,113,536
5Aug 31, 2026 01:474,23643,597,51134,116,0001,046,0002,113,536
6Aug 31, 2026 01:474,24243,654,26434,181,0001,028,0002,113,536
7Aug 31, 2026 01:474,27243,891,15934,419,0001,042,0002,113,536
8Aug 31, 2026 01:474,28143,997,36434,513,0001,021,0002,113,536
9Aug 31, 2026 01:474,32144,321,37534,829,0001,039,0002,113,536