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 19:48Mikołaj UzarskiMikołaj UzarskiScore: 5,887Success
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 19:485,81875,054,12741,251,0007,042,0002,523,136
2Feb 15, 2026 19:505,84269,474,31142,430,0006,061,0002,420,736
3Feb 15, 2026 19:485,84875,518,82541,460,0007,078,0002,437,120
4Feb 15, 2026 19:505,88775,779,01643,873,0004,985,0002,420,736
5Feb 15, 2026 19:505,91171,408,80942,053,0007,008,0002,392,064
6Feb 15, 2026 19:485,97478,265,22943,516,0006,072,0002,404,352