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 09:39Tomislav TunkovicTomislav TunkovicScore: 5,062Success
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 09:405,05250,415,08840,711,0001,228,0002,117,632
2Aug 15, 2026 09:405,05750,395,66840,719,0001,258,0002,117,632
3Aug 15, 2026 09:405,05750,398,93940,746,0001,229,0002,117,632
4Aug 15, 2026 09:405,06050,438,49540,761,0001,240,0002,117,632
5Aug 15, 2026 09:405,06250,510,17140,754,0001,267,0002,117,632
6Aug 15, 2026 09:405,19051,526,81141,875,0001,208,0002,117,632
7Aug 15, 2026 09:405,21951,786,37142,160,0001,159,0002,117,632
8Aug 15, 2026 09:405,25352,735,86942,441,0001,160,0002,117,632
9Aug 15, 2026 09:405,28253,389,34742,696,0001,152,0002,117,632