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 listFeb 9, 2026 18:50nunnunScore: 58,813Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 9, 2026 18:5058,797510,939,399486,012,0002,000,0002,281,472
2Feb 9, 2026 18:5058,798510,322,323486,024,0002,000,0002,351,104
3Feb 9, 2026 18:5058,801510,718,620488,049,00002,285,568
4Feb 9, 2026 18:5058,813510,471,150487,148,0001,000,0002,355,200
5Feb 9, 2026 18:5058,813514,131,712487,145,0001,000,0002,371,584
6Feb 9, 2026 18:5058,813512,454,042487,147,0001,000,0002,285,568
7Feb 9, 2026 18:5058,824520,021,098487,239,0001,000,0002,289,664
8Feb 9, 2026 18:5058,833515,357,369488,314,00002,285,568
9Feb 9, 2026 18:5058,834520,676,431488,321,00002,355,200