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 listJan 1, 2025 19:39matsuoka-601matsuoka-601Score: 39,279Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2025 19:3939,271350,739,194322,954,0002,999,0002,326,528
2Jan 1, 2025 19:3939,279351,632,511325,016,0001,000,0002,326,528
3Jan 1, 2025 19:3939,343353,180,627326,545,00002,326,528