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 listDec 6, 2025 11:16Rajarshi BasuRajarshi BasuScore: 7,125Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 6, 2025 11:166,96081,831,15555,778,0001,992,0002,289,664
2Dec 6, 2025 11:166,96882,470,19056,835,000997,0002,277,376
3Dec 6, 2025 11:166,96885,064,96255,837,0001,994,0002,289,664
4Dec 6, 2025 11:167,12587,554,46257,135,0002,004,0002,277,376
5Dec 6, 2025 11:167,13086,118,86457,172,0002,006,0002,289,664
6Dec 6, 2025 11:167,13392,274,11257,197,0002,006,0002,289,664