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 17:19matsuoka-601matsuoka-601Score: 38,195Success
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 17:1938,185343,316,881314,933,0001,999,0002,330,624
2Jan 1, 2025 17:1938,195345,709,927317,020,00002,441,216
3Jan 1, 2025 17:1938,218342,144,274316,208,0001,000,0002,289,664