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 17, 2026 23:57flavio87flavio87Score: 4,170Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 00:004,03941,669,07732,426,0001,104,0002,113,536
2Aug 18, 2026 00:004,13842,773,07533,216,0001,134,0002,113,536
3Aug 18, 2026 00:004,16367,045,22033,438,0001,122,0002,113,536
4Aug 18, 2026 00:004,17052,352,35333,553,0001,065,0002,113,536
5Aug 18, 2026 00:004,17043,022,39333,464,0001,155,0002,113,536
6Aug 18, 2026 00:004,17543,744,26533,613,0001,042,0002,113,536
7Aug 18, 2026 00:004,17643,036,00433,633,0001,033,0002,113,536
8Aug 18, 2026 00:004,18643,099,15633,679,0001,065,0002,113,536
9Aug 18, 2026 00:004,22060,600,70033,844,0001,182,0002,113,536