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 listOct 29, 2025 11:19eandr-67eandr-67Score: 272,395Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 29, 2025 11:19272,3032,294,114,0392,175,149,00084,966,0002,326,528
2Oct 29, 2025 11:19272,3552,294,059,5272,176,604,00083,946,0002,326,528
3Oct 29, 2025 11:19272,3762,283,426,5262,163,773,00096,945,0002,326,528
4Oct 29, 2025 11:19272,3802,287,197,3812,167,808,00092,948,0002,326,528
5Oct 29, 2025 11:19272,3952,297,894,6402,160,970,00099,906,0002,428,928
6Oct 29, 2025 11:19272,5222,288,552,5792,157,980,000103,950,0002,326,528
7Oct 29, 2025 11:19272,5422,289,881,5902,159,141,000102,959,0002,326,528
8Oct 29, 2025 11:19272,7532,289,913,3882,140,969,000122,883,0002,437,120
9Oct 29, 2025 11:19273,2492,296,798,3272,152,968,000114,998,0002,326,528