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 19:35Victor MerckléVictor MerckléScore: 4,184Success
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 19:364,17242,354,77233,518,0001,116,0002,113,536
2Jun 25, 2026 19:364,17842,363,60633,584,0001,097,0002,113,536
3Jun 25, 2026 19:364,17942,340,46633,579,0001,114,0002,113,536
4Jun 25, 2026 19:364,18242,384,77833,626,0001,088,0002,113,536
5Jun 25, 2026 19:364,18442,430,86533,628,0001,102,0002,113,536
6Jun 25, 2026 19:364,21342,567,85933,964,0001,009,0002,113,536
7Jun 25, 2026 19:364,33643,684,81934,910,0001,079,0002,113,536
8Jun 25, 2026 19:364,33944,111,46535,012,0001,004,0002,113,536
9Jun 25, 2026 19:364,46745,096,45235,998,0001,084,0002,113,536