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 listJun 22, 2026 11:34Omkar SinghOmkar SinghScore: 66,302Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2026 11:3566,187558,406,343491,212,00058,144,0002,113,536
2Jun 22, 2026 11:3566,239558,786,440490,664,00059,124,0002,113,536
3Jun 22, 2026 11:3566,278559,092,777491,392,00058,720,0002,113,536
4Jun 22, 2026 11:3566,285559,244,667491,690,00058,483,0002,113,536
5Jun 22, 2026 11:3566,302559,423,122491,857,00058,450,0002,113,536
6Jun 22, 2026 11:3566,314559,432,367491,968,00058,445,0002,113,536
7Jun 22, 2026 11:3566,355559,859,092491,927,00058,826,0002,113,536
8Jun 22, 2026 11:3566,360559,906,166491,937,00058,856,0002,113,536
9Jun 22, 2026 11:3566,395560,175,111491,669,00059,411,0002,113,536