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:33Mikołaj UzarskiMikołaj UzarskiScore: 6,068Success
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:336,00074,156,91243,822,0005,975,0002,502,656
2Feb 18, 2026 20:336,06874,555,45744,322,0006,043,0002,297,856
3Feb 18, 2026 20:336,07875,988,82243,384,0007,062,0002,347,008