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 9, 2025 03:13CheranMahalingamCheranMahalingamScore: 51,814Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2025 03:1351,784454,099,991427,811,0001,999,0002,285,568
2Oct 9, 2025 03:1351,793451,732,057427,880,0001,999,0002,285,568
3Oct 9, 2025 03:1351,806451,469,414427,994,0001,999,0002,285,568
4Oct 9, 2025 03:1351,809455,163,336429,011,0001,000,0002,277,376
5Oct 9, 2025 03:1351,814453,164,275428,054,0002,000,0002,265,088
6Oct 9, 2025 03:1351,814455,729,357429,058,0001,000,0002,285,568
7Oct 9, 2025 03:1351,817458,269,437428,080,0002,000,0002,277,376
8Oct 9, 2025 03:1351,825456,331,858429,146,0001,000,0002,285,568
9Oct 9, 2025 03:1351,843453,660,594429,299,0001,000,0002,285,568