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 listJul 27, 2025 16:26Ruoyu QiuRuoyu QiuScore: 222,157Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2025 16:26222,0851,876,853,8521,754,337,00088,966,0002,277,376
2Jul 27, 2025 16:26222,1571,875,619,7981,775,948,00067,959,0002,277,376
3Jul 27, 2025 16:26222,2251,870,743,6841,777,487,00066,980,0002,265,088