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 18, 2026 20:40Mikołaj UzarskiMikołaj UzarskiScore: 5,802Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 20:405,70867,468,01942,336,0005,040,0002,392,064
2Feb 18, 2026 20:495,72473,400,66940,431,0007,075,0002,404,352
3Feb 18, 2026 20:405,76071,448,89241,829,0005,975,0002,396,160
4Feb 18, 2026 20:515,76180,758,09140,846,0006,973,0002,445,312
5Feb 18, 2026 20:495,80270,628,48741,136,0007,023,0002,482,176
6Feb 18, 2026 20:515,80374,396,50644,154,0004,014,0002,514,944
7Feb 18, 2026 20:405,81575,214,30740,219,0008,043,0002,486,272
8Feb 18, 2026 20:495,84272,605,95241,420,0007,071,0002,400,256
9Feb 18, 2026 20:515,90771,866,37443,028,0006,003,0002,387,968