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 listJan 21, 2025 02:24Gerard SmitGerard SmitScore: 80,721Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 21, 2025 02:2480,470694,107,197601,908,00065,990,0002,392,064
2Jan 21, 2025 02:2480,614695,489,723588,087,00081,011,0002,465,792
3Jan 21, 2025 02:2480,655701,306,181599,497,00069,941,0002,310,144
4Jan 21, 2025 02:2480,680695,836,038645,657,00023,987,0002,510,848
5Jan 21, 2025 02:2480,721692,289,777618,988,00050,999,0002,310,144
6Jan 21, 2025 02:2480,774698,847,110613,477,00056,951,0002,375,680
7Jan 21, 2025 02:2480,785701,032,037578,581,00091,933,0002,375,680
8Jan 21, 2025 02:2481,557702,326,858624,929,00051,994,0002,387,968
9Jan 21, 2025 02:2481,672704,460,026613,886,00063,988,0002,285,568