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 23, 2025 06:15Tan Lip WeiTan Lip WeiScore: 50,690Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 23, 2025 06:1550,451443,717,076356,783,00061,962,0002,519,040
2Oct 23, 2025 06:1550,561442,561,124354,710,00064,947,0002,326,528
3Oct 23, 2025 06:1550,653449,849,906359,508,00060,916,0002,412,544
4Oct 23, 2025 06:1550,688451,712,260356,753,00063,955,0002,277,376
5Oct 23, 2025 06:1550,690441,633,762360,764,00059,960,0002,523,136
6Oct 23, 2025 06:1550,710442,716,827355,908,00064,983,0002,519,040
7Oct 23, 2025 06:1550,771446,245,495359,485,00061,911,0002,519,040
8Oct 23, 2025 06:1550,853445,058,273359,068,00063,012,0002,289,664
9Oct 23, 2025 06:1550,862451,450,244363,133,00059,021,0002,285,568