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 listNov 3, 2026 09:19Andrew EpsteinAndrew EpsteinScore: 53,475Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2026 09:1953,181450,849,504439,401,0002,005,0002,121,728stderr
2Nov 3, 2026 09:1953,244451,345,633439,916,0002,016,0002,121,728stderr
3Nov 3, 2026 09:1953,427452,661,004441,441,0002,005,0002,121,728stderr
4Nov 3, 2026 09:1953,443452,952,786441,571,0002,010,0002,121,728stderr
5Nov 3, 2026 09:1953,475453,691,455441,838,0002,012,0002,121,728stderr
6Nov 3, 2026 09:1953,595454,196,751442,770,0002,072,0002,121,728stderr
7Nov 3, 2026 09:1953,618454,331,516443,026,0002,009,0002,121,728stderr
8Nov 3, 2026 09:1953,840456,215,502444,857,0002,020,0002,121,728stderr
9Nov 3, 2026 09:1953,954457,547,142445,799,0002,023,0002,121,728stderr