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 listMay 11, 2026 01:38Josu San MartinJosu San MartinScore: 3,939Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 01:393,86739,767,90231,024,0001,080,0002,113,536
2May 11, 2026 01:393,87840,431,28131,088,0001,101,0002,113,536
3May 11, 2026 01:393,90540,156,96931,339,0001,078,0002,113,536
4May 11, 2026 01:393,90840,051,38631,369,0001,072,0002,113,536
5May 11, 2026 01:393,93941,834,77331,621,0001,080,0002,113,536
6May 11, 2026 01:393,94142,087,12831,659,0001,057,0002,113,536
7May 11, 2026 01:393,94240,412,99431,657,0001,069,0002,113,536
8May 11, 2026 01:393,95842,475,19831,767,0001,088,0002,113,536
9May 11, 2026 01:393,97442,327,33431,872,0001,117,0002,113,536