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 16:24Rajarshi BasuRajarshi BasuScore: 6,120Success
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 16:245,97979,248,27648,610,0001,012,0002,273,280
2Dec 6, 2025 16:245,98374,682,77748,649,0001,013,0002,281,472
3Dec 6, 2025 16:246,00577,786,69846,848,0002,990,0002,277,376
4Dec 6, 2025 16:246,12080,071,93648,804,0001,992,0002,289,664
5Dec 6, 2025 16:246,12476,303,63547,843,0002,990,0002,289,664
6Dec 6, 2025 16:246,13577,057,04048,924,0001,996,0002,277,376