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 25, 2026 16:11Victor MerckléVictor MerckléScore: 5,032Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 16:125,01249,067,23540,501,0001,101,0002,113,536
2Jun 25, 2026 16:125,02049,216,37240,561,0001,111,0002,113,536
3Jun 25, 2026 16:125,02349,281,11740,601,0001,091,0002,113,536
4Jun 25, 2026 16:125,03149,280,16940,731,0001,029,0002,113,536
5Jun 25, 2026 16:125,03249,295,55340,681,0001,087,0002,113,536
6Jun 25, 2026 16:125,04949,513,73440,842,0001,070,0002,113,536
7Jun 25, 2026 16:125,05949,568,47540,898,0001,094,0002,113,536
8Jun 25, 2026 16:125,06249,565,47540,884,0001,133,0002,113,536
9Jun 25, 2026 16:125,16050,336,22241,781,0001,048,0002,113,536