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 26, 2025 20:11sheryllynn24sheryllynn24Score: 6,338Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2025 20:116,33178,090,34951,541,0001,010,0002,289,664
2Sep 26, 2025 20:116,33381,198,46352,562,00002,289,664
3Sep 26, 2025 20:116,33683,300,54951,576,0001,011,0002,289,664
4Sep 26, 2025 20:116,33781,882,78452,595,00002,289,664
5Sep 26, 2025 20:116,33880,825,54551,592,0001,011,0002,269,184
6Sep 26, 2025 20:116,34078,064,18151,607,0001,011,0002,523,136
7Sep 26, 2025 20:116,34179,707,17051,617,0001,012,0002,289,664
8Sep 26, 2025 20:116,34482,162,54951,647,0001,012,0002,514,944
9Sep 26, 2025 20:116,36283,058,42651,811,000996,0002,289,664