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 20, 2026 21:53Maya RebholzMaya RebholzScore: 10,271Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 21:5410,26594,612,66983,025,0002,179,0002,113,536
2May 20, 2026 21:5410,26595,105,55683,037,0002,165,0002,113,536
3May 20, 2026 21:5410,26695,697,26783,032,0002,177,0002,113,536
4May 20, 2026 21:5410,26894,674,71583,075,0002,151,0002,113,536
5May 20, 2026 21:5410,27195,696,00983,065,0002,187,0002,113,536
6May 20, 2026 21:5410,27397,762,29383,088,0002,184,0002,113,536
7May 20, 2026 21:5410,27794,766,71083,142,0002,164,0002,113,536
8May 20, 2026 21:5410,27997,777,12583,135,0002,187,0002,113,536
9May 20, 2026 21:5410,28997,383,14783,164,0002,242,0002,113,536