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 28, 2026 20:31wnwnScore: 4,438Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 28, 2026 20:314,37562,840,44335,306,0001,008,0002,277,376
2Feb 28, 2026 20:314,38158,402,60035,356,0001,010,0002,277,376
3Feb 28, 2026 20:314,39257,789,92335,439,0001,012,0002,277,376
4Feb 28, 2026 20:314,43862,726,78135,837,000995,0002,486,272
5Feb 28, 2026 20:314,44061,005,87434,861,0001,992,0002,486,272
6Feb 28, 2026 20:314,46057,913,51635,018,0002,001,0002,277,376