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 listJan 6, 2025 22:44woodsy-sounding-wilful-sapwoodwoodsy-sounding-wilful-sapwoodScore: 623,504Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 6, 2025 22:44605,69314,653,704,2402,817,404,0002,209,845,000413,696
2Jan 6, 2025 22:44612,96617,280,752,2562,817,398,0002,270,221,000409,600
3Jan 6, 2025 22:44614,32216,975,703,6422,859,588,0002,239,287,000409,600
4Jan 6, 2025 22:44622,77714,902,927,5582,864,162,0002,304,888,000434,176
5Jan 6, 2025 22:44623,50414,628,141,0872,867,534,0002,307,548,000442,368
6Jan 6, 2025 22:44624,48914,799,187,3452,920,453,0002,262,809,000430,080
7Jan 6, 2025 22:44625,67614,874,913,4052,896,958,0002,296,152,000434,176
8Jan 6, 2025 22:44629,93714,866,175,8712,856,585,0002,371,893,000421,888
9Jan 6, 2025 22:44641,78917,322,887,6892,970,625,0002,356,225,000466,944