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 listAug 8, 2025 19:37Leon ZhaoLeon ZhaoScore: 18,280Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 8, 2025 19:3718,239174,422,362150,384,0001,002,0002,461,696
2Aug 8, 2025 19:3718,257182,939,348151,535,00002,461,696
3Aug 8, 2025 19:3718,260182,513,509151,559,00002,285,568
4Aug 8, 2025 19:3718,264177,340,929150,591,0001,003,0002,473,984
5Aug 8, 2025 19:3718,280180,164,781150,730,000998,0002,285,568
6Aug 8, 2025 19:3718,281176,720,009149,736,0001,996,0002,465,792
7Aug 8, 2025 19:3718,293177,763,998149,837,0001,997,0002,285,568
8Aug 8, 2025 19:3718,295176,791,353149,850,0001,998,0002,469,888
9Aug 8, 2025 19:3718,305180,320,820148,934,0002,998,0002,461,696