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 3, 2025 18:41Rajarshi BasuRajarshi BasuScore: 8,741Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 3, 2025 18:418,56393,143,73269,074,0002,002,0002,494,464
2Dec 3, 2025 18:418,571101,345,36869,138,0002,004,0002,289,664
3Dec 3, 2025 18:418,57798,566,05269,186,0002,005,0002,490,368
4Dec 3, 2025 18:418,741101,098,18671,542,0001,007,0002,289,664
5Dec 3, 2025 18:418,755104,470,00072,669,00002,289,664
6Dec 3, 2025 18:418,770102,978,04371,792,000997,0002,289,664