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 21:01Josu San MartinJosu San MartinScore: 4,296Success
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 21:024,26443,794,11634,369,0001,023,0002,113,536
2Aug 30, 2026 21:024,28244,060,75334,443,0001,101,0002,113,536
3Aug 30, 2026 21:024,28544,018,99834,537,0001,032,0002,113,536
4Aug 30, 2026 21:024,29144,090,58434,578,0001,043,0002,113,536
5Aug 30, 2026 21:024,29644,030,39534,630,0001,032,0002,113,536
6Aug 30, 2026 21:024,30544,228,75034,635,0001,104,0002,113,536
7Aug 30, 2026 21:024,31144,234,19834,751,0001,037,0002,113,536
8Aug 30, 2026 21:024,31144,226,96334,663,0001,120,0002,113,536
9Aug 30, 2026 21:024,32244,302,46934,824,0001,050,0002,113,536