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 02:11CheranMahalingamCheranMahalingamScore: 57,468Success
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 02:1157,420506,722,578474,590,0001,998,0002,367,488
2Oct 9, 2025 02:1157,423499,652,131474,611,0001,998,0002,285,568
3Oct 9, 2025 02:1157,426503,481,799474,636,0001,998,0002,285,568
4Oct 9, 2025 02:1157,457501,915,866475,898,000999,0002,285,568
5Oct 9, 2025 02:1157,468498,708,206475,988,000999,0002,285,568
6Oct 9, 2025 02:1157,478500,652,356475,066,0002,000,0002,285,568
7Oct 9, 2025 02:1157,486501,400,722475,133,0002,000,0002,285,568
8Oct 9, 2025 02:1157,492504,067,387476,182,0001,000,0002,285,568
9Oct 9, 2025 02:1157,526506,985,176476,465,000998,0002,285,568