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 11, 2026 21:24olliecrowolliecrowScore: 6,052Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 21:245,68271,526,84746,158,0001,003,0002,351,104
2Feb 11, 2026 21:245,68773,021,89544,190,0003,012,0002,342,912
3Feb 11, 2026 21:245,78276,580,35345,990,0001,999,0002,392,064
4Feb 11, 2026 21:246,05275,484,19444,206,0006,028,0002,326,528
5Feb 11, 2026 21:246,21981,554,26348,579,0003,036,0002,375,680
6Feb 11, 2026 21:246,32478,380,69847,445,0005,047,0002,404,352