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 29, 2026 04:42Victor MerckléVictor MerckléScore: 4,219Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 04:434,18242,495,01933,682,0001,032,0002,113,536
2Jun 29, 2026 04:434,21342,748,18433,956,0001,018,0002,113,536
3Jun 29, 2026 04:434,21442,916,58133,973,0001,008,0002,113,536
4Jun 29, 2026 04:434,21842,913,61233,971,0001,043,0002,113,536
5Jun 29, 2026 04:434,21942,954,83833,996,0001,022,0002,113,536
6Jun 29, 2026 04:434,22442,875,79734,059,0001,002,0002,113,536
7Jun 29, 2026 04:434,22542,804,27434,060,0001,010,0002,113,536
8Jun 29, 2026 04:434,22842,916,88234,051,0001,042,0002,113,536
9Jun 29, 2026 04:434,35643,948,25735,146,0001,009,0002,113,536