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 12:03Rajarshi BasuRajarshi BasuScore: 6,995Success
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 12:036,83082,974,49555,681,0001,012,0002,273,280
2Dec 6, 2025 12:036,84884,957,66555,841,000997,0002,527,232
3Dec 6, 2025 12:036,96383,827,83855,798,0001,992,0002,289,664
4Dec 6, 2025 12:036,99583,917,82956,060,0002,002,0002,289,664
5Dec 6, 2025 12:037,00687,863,42356,145,0002,005,0002,281,472
6Dec 6, 2025 12:037,01783,035,61256,233,0002,008,0002,289,664