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, 2024 15:47Dmitrii KravchenkoDmitrii KravchenkoScore: 70,470Success
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, 2024 15:4770,396612,940,176521,255,00063,030,0002,269,184
2Sep 11, 2024 15:4770,409614,512,242514,470,00069,927,0002,289,664
3Sep 11, 2024 15:4770,428608,619,517504,615,00079,939,0002,523,136
4Sep 11, 2024 15:4770,434618,202,390514,648,00069,952,0002,289,664
5Sep 11, 2024 15:4770,470611,294,474506,911,00077,986,0002,277,376
6Sep 11, 2024 15:4770,578612,317,889515,821,00069,975,0002,273,280
7Sep 11, 2024 15:4770,605610,234,646515,022,00071,003,0002,265,088
8Sep 11, 2024 15:4770,681617,896,072525,686,00060,963,0002,289,664
9Sep 11, 2024 15:4770,830619,638,329513,900,00073,985,0002,265,088