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 30, 2025 15:55Rajarshi BasuRajarshi BasuScore: 13,768Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 30, 2025 15:5513,756141,747,714112,172,0002,003,0002,289,664
2Nov 30, 2025 15:5513,761137,726,690113,215,0001,001,0002,289,664
3Nov 30, 2025 15:5513,765140,869,866112,243,0002,004,0002,510,848
4Nov 30, 2025 15:5513,766136,135,996112,255,0002,004,0002,273,280
5Nov 30, 2025 15:5513,768143,266,616112,271,0002,004,0002,273,280
6Nov 30, 2025 15:5513,769136,098,390112,277,0002,004,0002,265,088
7Nov 30, 2025 15:5513,770141,278,783112,289,0002,005,0002,289,664
8Nov 30, 2025 15:5513,771148,052,920112,291,0002,005,0002,289,664
9Nov 30, 2025 15:5513,794142,666,509113,484,0001,004,0002,289,664