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 listJul 13, 2025 21:10Cyril SharmaCyril SharmaScore: 69,402Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2025 21:1069,171601,041,861496,104,00078,016,0002,285,568
2Jul 13, 2025 21:1069,194600,918,512476,260,00098,053,0002,285,568
3Jul 13, 2025 21:1069,345605,768,570510,612,00064,950,0002,285,568
4Jul 13, 2025 21:1069,350600,996,753508,655,00066,954,0002,465,792
5Jul 13, 2025 21:1069,402601,695,141497,035,00079,005,0002,285,568
6Jul 13, 2025 21:1069,457605,778,901520,443,00056,047,0002,469,888
7Jul 13, 2025 21:1069,467605,041,755520,618,00055,958,0002,285,568
8Jul 13, 2025 21:1069,513603,852,303518,960,00057,995,0002,277,376
9Jul 13, 2025 21:1069,565604,966,437509,347,00068,046,0002,326,528