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 11, 2026 19:10olliecrowolliecrowScore: 6,286Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 19:105,91678,805,46647,101,0002,004,0002,351,104
2Feb 11, 2026 19:105,92678,236,10945,171,0004,015,0002,359,296
3Feb 11, 2026 19:105,93682,435,65047,260,0002,011,0002,367,488
4Feb 11, 2026 19:106,21077,811,77548,515,0003,032,0002,449,408
5Feb 11, 2026 19:106,24084,225,83849,798,0001,991,0002,428,928
6Feb 11, 2026 19:106,28377,770,38447,137,0005,014,0002,342,912
7Feb 11, 2026 19:106,28674,952,21250,169,0002,006,0002,441,216
8Feb 11, 2026 19:106,30079,053,59050,275,0002,011,0002,301,952
9Feb 11, 2026 19:106,33479,548,00249,542,0003,033,0002,351,104
10Feb 11, 2026 19:106,41182,030,84350,203,0003,012,0002,420,736
11Feb 11, 2026 19:106,47583,480,74649,765,0003,981,0002,461,696
12Feb 11, 2026 19:106,52982,143,90952,187,0002,007,0002,314,240