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 listJun 23, 2025 20:06Valentin KofmanValentin KofmanScore: 7,807Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2025 20:067,71885,620,68563,056,0001,000,0002,289,664
2Jun 23, 2025 20:067,73789,632,47062,209,0002,006,0002,289,664
3Jun 23, 2025 20:067,75785,884,36664,382,00002,289,664
4Jun 23, 2025 20:067,75885,072,17364,388,00002,400,256
5Jun 23, 2025 20:067,78392,696,08063,587,0001,009,0002,289,664
6Jun 23, 2025 20:067,80492,993,83762,784,0001,993,0002,289,664
7Jun 23, 2025 20:067,80793,492,54163,804,000996,0002,273,280
8Jun 23, 2025 20:067,80793,784,84862,809,0001,993,0002,289,664
9Jun 23, 2025 20:067,92692,494,51864,786,000996,0002,269,184
10Jun 23, 2025 20:0610,936115,324,94888,776,0001,994,0002,289,664
11Jun 23, 2025 20:0610,984117,022,88289,166,0002,003,0002,289,664
12Jun 23, 2025 20:0610,991115,844,97989,220,0002,004,0002,289,664