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:01Mikołaj UzarskiMikołaj UzarskiScore: 6,348Success
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:046,30777,060,98344,292,0008,053,0002,342,912
2Feb 19, 2026 22:016,33072,647,47246,475,0006,062,0002,473,984
3Feb 19, 2026 22:046,34381,058,51750,622,0002,024,0002,445,312
4Feb 19, 2026 22:016,34881,181,77544,739,0007,953,0002,457,600
5Feb 19, 2026 22:046,41983,654,13045,235,0008,041,0002,498,560
6Feb 19, 2026 22:016,53777,514,07047,224,0007,033,0002,441,216