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 00:36Tomislav TunkovicTomislav TunkovicScore: 5,768Success
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 00:365,74156,010,47046,379,0001,277,0002,121,728stderr
2Aug 15, 2026 00:365,75656,154,05146,767,0001,015,0002,121,728stderr
3Aug 15, 2026 00:365,76056,191,34546,793,0001,015,0002,121,728stderr
4Aug 15, 2026 00:365,76456,353,30046,826,0001,016,0002,121,728stderr
5Aug 15, 2026 00:365,76856,278,82846,866,0001,014,0002,121,728stderr
6Aug 15, 2026 00:365,76856,188,47846,867,0001,014,0002,121,728stderr
7Aug 15, 2026 00:365,76956,219,95246,875,0001,013,0002,121,728stderr
8Aug 15, 2026 00:365,82056,705,37647,036,0001,271,0002,121,728stderr
9Aug 15, 2026 00:365,91957,503,82248,115,0001,013,0002,121,728stderr