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 10:06Tomislav TunkovicTomislav TunkovicScore: 5,066Success
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 10:065,06150,478,98940,969,0001,045,0002,121,728stderr
2Aug 15, 2026 10:065,06350,488,15240,992,0001,039,0002,121,728stderr
3Aug 15, 2026 10:065,06350,423,87940,992,0001,037,0002,121,728stderr
4Aug 15, 2026 10:065,06450,456,51140,992,0001,045,0002,121,728stderr
5Aug 15, 2026 10:065,06650,534,90941,025,0001,029,0002,121,728stderr
6Aug 15, 2026 10:065,07750,490,21541,112,0001,035,0002,121,728stderr
7Aug 15, 2026 10:065,08450,609,34741,166,0001,032,0002,121,728stderr
8Aug 15, 2026 10:065,08650,662,10441,173,0001,045,0002,121,728stderr
9Aug 15, 2026 10:065,13250,944,82041,570,0001,028,0002,121,728stderr