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 25, 2025 18:57Ruoyu QiuRuoyu QiuScore: 516,535Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 25, 2025 18:57515,7674,305,848,8164,195,913,00084,957,0002,285,568
2Jul 25, 2025 18:57516,2014,309,781,9634,207,516,00076,954,0002,277,376
3Jul 25, 2025 18:57516,3214,311,077,8174,220,507,00064,961,0002,285,568
4Jul 25, 2025 18:57516,4314,319,145,8714,223,403,00062,976,0002,277,376
5Jul 25, 2025 18:57516,5354,310,913,4294,204,277,00082,966,0002,285,568
6Jul 25, 2025 18:57516,5864,315,536,0404,208,709,00078,957,0002,277,376
7Jul 25, 2025 18:57516,5924,315,143,5544,210,753,00076,958,0002,277,376
8Jul 25, 2025 18:57516,6864,314,506,3954,210,524,00077,972,0002,265,088
9Jul 25, 2025 18:57517,2744,318,009,7434,215,408,00077,970,0002,277,376