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 listAug 15, 2026 22:16marko1597marko1597Score: 132,495Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 22:38131,6801,103,018,7741,091,801,0001,148,0002,117,632stderr
2Aug 15, 2026 22:38131,9161,105,135,4751,093,902,0001,002,0002,117,632stderr
3Aug 15, 2026 22:38131,9161,105,096,6951,093,750,0001,158,0002,117,632stderr
4Aug 15, 2026 22:38132,3271,108,847,2101,097,309,0001,008,0002,117,632stderr
5Aug 15, 2026 22:38132,4951,109,841,2041,098,536,0001,179,0002,117,632stderr
6Aug 15, 2026 22:38132,5071,109,960,2541,098,610,0001,205,0002,117,632stderr
7Aug 15, 2026 22:38132,8081,112,441,5311,101,307,0001,004,0002,117,632stderr
8Aug 15, 2026 22:38133,0611,116,685,8511,103,236,0001,177,0002,117,632stderr
9Aug 15, 2026 22:38133,1111,115,572,0841,103,589,0001,235,0002,117,632stderr