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:41Mikołaj UzarskiMikołaj UzarskiScore: 5,968Success
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:415,91078,032,45643,045,0006,006,0002,441,216
2Feb 15, 2026 19:415,92173,185,95243,125,0006,017,0002,478,080
3Feb 15, 2026 19:415,92276,716,62543,133,0006,018,0002,473,984
4Feb 15, 2026 19:445,96873,730,79043,472,0006,065,0002,449,408
5Feb 15, 2026 19:445,96980,079,68142,465,0007,077,0002,310,144
6Feb 15, 2026 19:445,97475,879,05544,528,0005,060,0002,404,352