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 14, 2026 13:45marko1597marko1597Score: 6,656Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 13:466,64865,020,74054,127,0001,054,0002,113,536
2Aug 14, 2026 13:466,64965,024,77754,146,0001,046,0002,113,536
3Aug 14, 2026 13:466,65165,024,78054,149,0001,062,0002,113,536
4Aug 14, 2026 13:466,65465,043,17954,190,0001,046,0002,113,536
5Aug 14, 2026 13:466,65665,094,56954,188,0001,057,0002,113,536
6Aug 14, 2026 13:466,74665,815,91854,949,0001,049,0002,113,536
7Aug 14, 2026 13:466,79166,184,11955,184,0001,186,0002,113,536
8Aug 14, 2026 13:466,80566,306,63655,474,0001,009,0002,113,536
9Aug 14, 2026 13:466,84366,692,27555,633,0001,172,0002,113,536