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 20:34Mikołaj UzarskiMikołaj UzarskiScore: 6,851Success
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 20:356,76877,036,07350,154,0006,018,0002,478,080
2Feb 15, 2026 20:346,80379,428,60750,418,0006,050,0002,424,832
3Feb 15, 2026 20:356,82182,988,20951,563,0005,055,0002,301,952
4Feb 15, 2026 20:346,85181,246,15549,881,0006,983,0002,469,888
5Feb 15, 2026 20:357,21486,529,60853,892,0005,988,0002,314,240
6Feb 15, 2026 20:349,21999,113,04969,468,0007,047,0002,494,464