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 27, 2025 18:35Josu San MartinJosu San MartinScore: 32,256Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 27, 2025 18:3532,224293,114,177266,457,0001,001,0002,289,664
2Dec 27, 2025 18:3532,230293,627,450267,510,00002,363,392
3Dec 27, 2025 18:3532,253296,899,853265,700,0001,997,0002,351,104
4Dec 27, 2025 18:3532,254296,018,251266,713,000998,0002,289,664
5Dec 27, 2025 18:3532,256292,373,904266,726,000998,0002,289,664
6Dec 27, 2025 18:3532,256294,386,955265,724,0001,997,0002,289,664
7Dec 27, 2025 18:3532,264292,743,891266,796,000999,0002,453,504
8Dec 27, 2025 18:3532,285297,011,961267,962,00002,285,568
9Dec 27, 2025 18:3532,289294,691,602266,999,000999,0002,289,664