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 10:40Daniel MastalerzDaniel MastalerzScore: 6,393Success
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 10:416,37864,134,62551,801,0001,140,0002,113,536
2Jun 27, 2026 10:416,37962,367,77251,791,0001,159,0002,113,536
3Jun 27, 2026 10:416,38562,524,54451,986,0001,015,0002,113,536
4Jun 27, 2026 10:416,38762,503,59551,807,0001,210,0002,113,536
5Jun 27, 2026 10:416,39362,570,93851,835,0001,234,0002,113,536
6Jun 27, 2026 10:416,39462,527,69451,915,0001,158,0002,113,536
7Jun 27, 2026 10:416,41562,702,21352,015,0001,236,0002,113,536
8Jun 27, 2026 10:416,41962,748,94152,251,0001,034,0002,113,536
9Jun 27, 2026 10:416,42662,852,11852,322,0001,014,0002,113,536