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 12:31Tomislav TunkovicTomislav TunkovicScore: 4,770Success
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 12:324,75847,987,96438,479,0001,017,0002,117,632
2Aug 15, 2026 12:324,75847,913,64238,480,0001,018,0002,117,632
3Aug 15, 2026 12:324,76048,011,04038,491,0001,017,0002,117,632
4Aug 15, 2026 12:324,76448,566,07438,526,0001,017,0002,117,632
5Aug 15, 2026 12:324,77048,050,17138,578,0001,018,0002,117,632
6Aug 15, 2026 12:324,77050,016,33438,577,0001,017,0002,117,632
7Aug 15, 2026 12:324,77348,044,20138,602,0001,018,0002,117,632
8Aug 15, 2026 12:324,77548,717,60238,620,0001,016,0002,117,632
9Aug 15, 2026 12:324,77648,136,23238,629,0001,019,0002,117,632