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 listMay 14, 2026 05:24Victor MerckléVictor MerckléScore: 30,233Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 05:2530,190260,496,105250,581,00002,113,536
2May 14, 2026 05:2530,218260,866,714249,797,0001,018,0002,113,536
3May 14, 2026 05:2530,220260,218,611250,830,00002,113,536
4May 14, 2026 05:2530,228258,111,977250,898,00002,113,536
5May 14, 2026 05:2530,233258,207,464250,939,00002,113,536
6May 14, 2026 05:2530,236258,727,033250,965,00002,113,536
7May 14, 2026 05:2530,239258,461,160249,959,0001,025,0002,113,536
8May 14, 2026 05:2530,248259,454,392249,981,0001,080,0002,113,536
9May 14, 2026 05:2530,268258,686,462250,120,0001,112,0002,113,536