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 19, 2026 23:45Mikołaj UzarskiMikołaj UzarskiScore: 5,831Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 23:455,79772,404,20344,107,0004,009,0002,392,064
2Feb 19, 2026 23:455,83170,496,42843,355,0005,041,0002,498,560
3Feb 19, 2026 23:456,55576,595,42147,356,0007,053,0002,342,912