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, 2025 09:33AntonAntonScore: 68,459Success
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, 2025 09:3368,385596,914,450509,640,00057,959,0002,543,616
2Nov 3, 2025 09:3368,407596,989,256514,800,00052,979,0002,424,832
3Nov 3, 2025 09:3368,432589,453,632512,984,00054,998,0002,416,640
4Nov 3, 2025 09:3368,444598,375,863516,078,00052,007,0002,412,544
5Nov 3, 2025 09:3368,459594,380,554512,191,00056,020,0002,301,952
6Nov 3, 2025 09:3368,500594,581,417514,592,00053,957,0002,424,832
7Nov 3, 2025 09:3368,684601,373,627513,073,00057,008,0002,408,448
8Nov 3, 2025 09:3368,741599,996,176518,590,00051,958,0002,416,640
9Nov 3, 2025 09:33105,627903,056,051794,733,00081,972,0002,535,424