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 08:48Adam FolwarcznyAdam FolwarcznyScore: 16,168Success
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 08:4815,401137,160,180126,665,0001,164,0002,113,536
2Jun 29, 2026 08:4815,443137,513,763127,011,0001,170,0002,113,536
3Jun 29, 2026 08:4815,612138,966,680128,432,0001,152,0002,113,536
4Jun 29, 2026 08:4816,131143,263,814132,750,0001,138,0002,113,536
5Jun 29, 2026 08:4816,168143,473,340133,042,0001,159,0002,113,536
6Jun 29, 2026 08:4816,194143,712,522133,257,0001,156,0002,113,536
7Jun 29, 2026 08:4816,278145,729,436134,107,0001,002,0002,113,536
8Jun 29, 2026 08:4816,294145,147,256134,090,0001,158,0002,113,536
9Jun 29, 2026 08:4816,342145,022,207134,460,0001,182,0002,113,536