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 listSep 20, 2025 10:25sheryllynn24sheryllynn24Score: 9,774Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2025 10:259,421108,719,60476,188,0002,004,0002,285,568
2Sep 20, 2025 10:259,429103,991,94276,255,0002,006,0002,355,200
3Sep 20, 2025 10:259,455112,757,70677,484,000993,0002,506,752
4Sep 20, 2025 10:259,771105,576,09579,101,0002,002,0002,285,568
5Sep 20, 2025 10:259,772101,380,05079,107,0002,002,0002,265,088
6Sep 20, 2025 10:259,773111,030,89780,111,0001,001,0002,371,584
7Sep 20, 2025 10:259,774109,477,34879,124,0002,003,0002,506,752
8Sep 20, 2025 10:259,775110,630,27679,133,0002,003,0002,510,848
9Sep 20, 2025 10:259,778107,188,46879,157,0002,003,0002,510,848
10Sep 20, 2025 10:259,779110,395,37479,162,0002,004,0002,285,568
11Sep 20, 2025 10:259,785106,642,56679,208,0002,005,0002,285,568
12Sep 20, 2025 10:259,790107,429,67679,255,0002,006,0002,519,040