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 listFeb 24, 2026 21:37wnwnScore: 4,410Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 21:374,38555,798,12435,386,0001,011,0002,535,424
2Feb 24, 2026 21:374,40259,582,77335,523,0001,014,0002,535,424
3Feb 24, 2026 21:384,40561,734,44435,544,0001,015,0002,486,272
4Feb 24, 2026 21:384,41062,180,20135,584,0001,016,0002,498,560
5Feb 24, 2026 21:384,43961,990,51035,849,000995,0002,535,424
6Feb 24, 2026 21:374,45862,019,34835,005,0002,000,0002,535,424