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 27, 2026 12:39Daniel MastalerzDaniel MastalerzScore: 4,985Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 12:394,98050,801,92640,304,0001,032,0002,113,536
2Jun 27, 2026 12:394,98350,786,69440,329,0001,033,0002,113,536
3Jun 27, 2026 12:394,98450,797,79940,335,0001,039,0002,113,536
4Jun 27, 2026 12:394,98550,873,58840,341,0001,036,0002,113,536
5Jun 27, 2026 12:394,98550,825,87440,352,0001,031,0002,113,536
6Jun 27, 2026 12:394,99350,897,48140,405,0001,043,0002,113,536
7Jun 27, 2026 12:394,99550,953,32440,411,0001,055,0002,113,536
8Jun 27, 2026 12:394,99651,033,09140,416,0001,057,0002,113,536
9Jun 27, 2026 12:394,99950,962,81640,455,0001,042,0002,113,536