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 listJul 20, 2026 21:31Kevin HeaveyKevin HeaveyScore: 22,486Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 20, 2026 21:3212,966117,339,252106,612,0001,009,0002,117,632
2Jul 20, 2026 21:3213,722123,570,397112,630,0001,266,0002,117,632
3Jul 20, 2026 21:3213,959125,558,799114,578,0001,282,0002,117,632
4Jul 20, 2026 21:3222,440196,013,952185,003,0001,257,0002,117,632
5Jul 20, 2026 21:3222,486198,187,936185,362,0001,274,0002,117,632
6Jul 20, 2026 21:3222,556196,912,541186,213,0001,005,0002,117,632
7Jul 20, 2026 21:3222,705198,269,154187,450,0001,006,0002,117,632
8Jul 20, 2026 21:3223,296203,013,554192,112,0001,253,0002,117,632
9Jul 20, 2026 21:3223,450204,291,561193,612,0001,024,0002,117,632