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 12:54Andrew EpsteinAndrew EpsteinScore: 22,471Success
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 12:5522,337194,662,250184,351,0001,050,00024,576stderr
2Nov 3, 2026 12:5522,387195,020,674184,713,0001,107,00024,576stderr
3Nov 3, 2026 12:5522,392195,110,434185,858,000024,576stderr
4Nov 3, 2026 12:5522,426195,375,058185,109,0001,028,00024,576stderr
5Nov 3, 2026 12:5522,471195,792,415186,511,000024,576stderr
6Nov 3, 2026 12:5522,510196,182,230186,841,000024,576stderr
7Nov 3, 2026 12:5522,510196,155,826186,840,000024,576stderr
8Nov 3, 2026 12:5522,533196,635,138187,028,000024,576stderr
9Nov 3, 2026 12:5522,563196,618,284187,274,000024,576stderr