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 04:35Andrew EpsteinAndrew EpsteinScore: 58,526Success
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 05:0557,996490,772,994479,284,0002,091,0002,121,728stderr
2Nov 3, 2026 05:0558,361495,088,753482,388,0002,012,0002,121,728stderr
3Nov 3, 2026 05:0558,492494,746,291483,476,0002,014,0002,121,728stderr
4Nov 3, 2026 05:0558,517494,954,046483,679,0002,013,0002,121,728stderr
5Nov 3, 2026 05:0558,526495,495,713483,760,0002,006,0002,121,728stderr
6Nov 3, 2026 05:0558,606496,192,555484,426,0002,005,0002,121,728stderr
7Nov 3, 2026 05:0558,610496,283,308484,457,0002,008,0002,121,728stderr
8Nov 3, 2026 05:0558,737496,832,997485,510,0002,015,0002,121,728stderr
9Nov 3, 2026 05:0558,753497,294,010485,627,0002,023,0002,121,728stderr