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 listMar 15, 2026 16:30shartgepettoshartgepettoScore: 8,057Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 16:308,02295,441,54563,555,0003,026,0002,383,872
2Mar 15, 2026 16:308,04690,359,04162,796,0003,987,0002,412,544
3Mar 15, 2026 16:308,04992,787,05161,818,0004,985,0002,404,352
4Mar 15, 2026 16:308,05192,180,88762,831,0003,989,0002,486,272
5Mar 15, 2026 16:308,05791,490,51663,876,0002,994,0002,490,368
6Mar 15, 2026 16:308,08192,591,31063,072,0004,004,0002,396,160
7Mar 15, 2026 16:308,10392,193,82565,247,0002,007,0002,404,352
8Mar 15, 2026 16:308,10690,501,87766,278,0001,004,0002,420,736
9Mar 15, 2026 16:308,11294,152,52263,310,0004,019,0002,347,008