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 2, 2025 17:47Aniruddha DebAniruddha DebScore: 20,515Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 2, 2025 17:4720,496191,926,121169,116,0001,000,0002,437,120
2Mar 2, 2025 17:4720,505196,411,993170,190,00002,531,328
3Mar 2, 2025 17:4720,507193,235,501169,204,0001,001,0002,510,848
4Mar 2, 2025 17:4720,512191,923,739170,253,00002,531,328
5Mar 2, 2025 17:4720,515195,167,854170,277,00002,269,184
6Mar 2, 2025 17:4720,519193,523,506169,306,0001,001,0002,510,848
7Mar 2, 2025 17:4720,521197,532,922169,322,0001,001,0002,269,184
8Mar 2, 2025 17:4720,524192,022,490170,351,00002,269,184
9Mar 2, 2025 17:4720,538194,726,013168,470,0001,993,0002,269,184