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 21, 2026 15:01Andrew EpsteinAndrew EpsteinScore: 3,831Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2026 15:013,67740,289,42429,438,0001,085,0002,113,536
2Aug 21, 2026 15:013,69340,504,54629,540,0001,112,0002,113,536
3Aug 21, 2026 15:013,71940,585,05129,778,0001,094,0002,113,536
4Aug 21, 2026 15:013,81741,426,18530,604,0001,079,0002,113,536
5Aug 21, 2026 15:013,83141,592,63830,726,0001,076,0002,113,536
6Aug 21, 2026 15:013,84841,696,48830,845,0001,096,0002,113,536
7Aug 21, 2026 15:013,86842,249,82931,016,0001,090,0002,113,536
8Aug 21, 2026 15:013,89142,035,20831,190,0001,110,0002,113,536
9Aug 21, 2026 15:013,89442,239,90131,235,0001,092,0002,113,536