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 22:15Mikołaj UzarskiMikołaj UzarskiScore: 5,882Success
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 22:155,83779,983,18341,384,0007,065,0002,461,696
2Feb 19, 2026 22:155,84371,777,80741,427,0007,073,0002,523,136
3Feb 19, 2026 22:155,85078,346,88144,507,0004,046,0002,281,472
4Feb 19, 2026 22:155,88275,339,75743,836,0004,981,0002,404,352
5Feb 19, 2026 22:155,88473,383,40043,853,0004,983,0002,318,336
6Feb 19, 2026 22:155,92972,181,41943,186,0006,026,0002,453,504