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 listSep 11, 2025 10:52MylesMylesScore: 63,413Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2025 10:5263,365547,835,570524,931,000999,0002,514,944
2Sep 11, 2025 10:5263,385547,634,167524,095,0002,000,0002,289,664
3Sep 11, 2025 10:5263,388554,396,005525,122,0001,000,0002,269,184
4Sep 11, 2025 10:5263,403553,290,377525,244,0001,000,0002,265,088
5Sep 11, 2025 10:5263,413554,891,480525,330,0001,000,0002,523,136
6Sep 11, 2025 10:5263,420552,255,305525,387,0001,000,0002,289,664
7Sep 11, 2025 10:5263,440558,173,725525,554,000999,0002,289,664
8Sep 11, 2025 10:5263,441555,513,708524,562,0001,998,0002,289,664
9Sep 11, 2025 10:5263,463548,724,546524,743,0001,999,0002,273,280