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 listNov 8, 2026 20:29Damir ZainullinDamir ZainullinScore: 2,044,195Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 8, 2026 20:312,040,17016,944,494,88316,869,340,00064,071,0002,113,536
2Nov 8, 2026 20:312,040,54916,947,655,71416,872,244,00064,313,0002,113,536
3Nov 8, 2026 20:312,041,24916,953,990,03016,877,300,00065,069,0002,113,536
4Nov 8, 2026 20:312,041,44616,956,069,49716,878,925,00065,078,0002,113,536
5Nov 8, 2026 20:312,044,19516,978,088,91916,902,784,00064,036,0002,113,536
6Nov 8, 2026 20:312,046,85817,000,331,07616,924,881,00064,043,0002,113,536
7Nov 8, 2026 20:312,047,55017,005,710,78316,929,631,00065,038,0002,113,536
8Nov 8, 2026 20:312,050,44117,030,092,61716,953,630,00065,036,0002,113,536
9Nov 8, 2026 20:312,167,68218,002,916,56417,927,702,00064,061,0002,113,536