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 15, 2026 14:19Mikołaj UzarskiMikołaj UzarskiScore: 6,183Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 14:226,09281,889,85944,494,0006,067,0002,301,952
2Feb 15, 2026 14:396,11977,108,51045,812,0004,979,0002,453,504
3Feb 15, 2026 14:226,12874,707,53247,873,0002,992,0002,297,856
4Feb 15, 2026 14:396,18375,813,68246,288,0005,031,0002,269,184
5Feb 15, 2026 14:226,20278,521,03044,409,0007,065,0002,416,640
6Feb 15, 2026 14:396,21279,944,97045,495,0006,066,0002,473,984