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 15:25Rajarshi BasuRajarshi BasuScore: 6,282Success
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 15:256,16373,781,06449,149,0002,006,0002,289,664
2Dec 6, 2025 15:216,16475,104,62350,155,0001,003,0002,265,088
3Dec 6, 2025 15:216,16572,942,19949,167,0002,006,0002,289,664
4Dec 6, 2025 15:256,16674,423,48050,172,0001,003,0002,289,664
5Dec 6, 2025 15:256,16973,882,27048,190,0003,011,0002,273,280
6Dec 6, 2025 15:216,27176,061,14250,050,0002,002,0002,293,760
7Dec 6, 2025 15:256,28273,682,28650,135,0002,005,0002,289,664
8Dec 6, 2025 15:216,28873,784,84051,184,0001,003,0002,273,280
9Dec 6, 2025 15:216,28977,772,43149,186,0003,011,0002,289,664
10Dec 6, 2025 15:256,40479,788,05553,156,00002,289,664
11Dec 6, 2025 15:256,41273,665,89752,216,0001,004,0002,289,664
12Dec 6, 2025 15:216,41580,490,18251,235,0002,009,0002,289,664