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 listJul 26, 2026 22:20boop34boop34Score: 48,068Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 26, 2026 22:2147,294402,586,674379,842,00012,703,0002,113,536
2Jul 26, 2026 22:2147,500404,375,171383,345,00010,913,0002,113,536
3Jul 26, 2026 22:2147,981409,099,921386,374,00011,874,00020,480
4Jul 26, 2026 22:2147,998408,486,855386,055,00012,333,00020,480
5Jul 26, 2026 22:2148,068409,831,445385,665,00013,303,00020,480
6Jul 26, 2026 22:2148,103409,444,267383,956,00015,304,00020,480
7Jul 26, 2026 22:2148,137409,742,301385,404,00014,134,00020,480
8Jul 26, 2026 22:2148,145409,695,092386,286,00013,325,00020,480
9Jul 26, 2026 22:2149,437422,509,945396,834,00013,494,0002,113,536