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 6, 2026 15:41chereshnya123chereshnya123Score: 64,587Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 15:4264,342543,332,218476,088,00057,953,0002,113,536
2Jun 6, 2026 15:4264,371543,585,325475,353,00058,928,0002,113,536
3Jun 6, 2026 15:4264,395543,732,553476,306,00058,178,0002,113,536
4Jun 6, 2026 15:4264,517544,685,000476,753,00058,741,0002,113,536
5Jun 6, 2026 15:4264,587546,046,937476,740,00059,337,0002,113,536
6Jun 6, 2026 15:4264,663546,010,282477,343,00059,361,0002,113,536
7Jun 6, 2026 15:4264,763547,152,508478,527,00059,012,0002,113,536
8Jun 6, 2026 15:4264,815547,333,790478,694,00059,271,0002,113,536
9Jun 6, 2026 15:4265,604553,782,925479,623,00064,894,0002,113,536