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 29, 2025 18:19Rajarshi BasuRajarshi BasuScore: 28,196Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 29, 2025 18:1928,179258,043,498231,886,0001,999,0002,396,160
2Nov 29, 2025 18:1928,183267,435,625231,916,0001,999,0002,260,992
3Nov 29, 2025 18:1928,190260,537,006231,979,0001,999,0002,289,664
4Nov 29, 2025 18:1928,192259,672,722231,992,0001,999,0002,260,992
5Nov 29, 2025 18:1928,196258,493,191231,030,0003,000,0002,285,568
6Nov 29, 2025 18:1928,199263,677,313233,048,0001,000,0002,269,184
7Nov 29, 2025 18:1928,199263,090,492232,052,0002,000,0002,289,664
8Nov 29, 2025 18:1928,202257,214,031232,079,0002,000,0002,289,664
9Nov 29, 2025 18:1928,208258,731,582232,126,0002,001,0002,519,040