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 26, 2026 07:09Victor MerckléVictor MerckléScore: 4,185Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 07:104,15341,962,89233,389,0001,082,0002,113,536
2Jun 26, 2026 07:104,15441,976,21533,370,0001,112,0002,113,536
3Jun 26, 2026 07:104,17542,157,47333,545,0001,113,0002,113,536
4Jun 26, 2026 07:104,17742,116,04733,595,0001,076,0002,113,536
5Jun 26, 2026 07:104,18542,223,98333,604,0001,135,0002,113,536
6Jun 26, 2026 07:104,20242,332,55233,783,0001,098,0002,113,536
7Jun 26, 2026 07:104,21442,456,72833,964,0001,016,0002,113,536
8Jun 26, 2026 07:104,36443,753,78335,191,0001,034,0002,113,536
9Jun 26, 2026 07:104,42644,555,60435,727,0001,015,0002,113,536