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 listDec 6, 2025 15:02Rajarshi BasuRajarshi BasuScore: 6,842Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 6, 2025 15:026,68379,274,64454,460,0001,008,0002,289,664
2Dec 6, 2025 15:026,68877,919,27354,498,0001,009,0002,273,280
3Dec 6, 2025 15:026,68880,081,53955,512,00002,396,160
4Dec 6, 2025 15:026,84284,586,78954,797,0001,992,0002,269,184
5Dec 6, 2025 15:026,84382,714,25456,798,00002,269,184
6Dec 6, 2025 15:026,84686,582,54854,832,0001,993,0002,265,088