Format integers Sergey Svistunov

Compute a checksum over the decimal representations of binary integers as fast as possible.

Input: 250 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: A uint64 checksum computed as:

CRC = sum of number_crc(n) for each n

where number_crc(n) converts n to its decimal string and sums ascii(digit) * position over each digit (0-indexed from the left).

Example: For n = 42, the decimal string is "42", so number_crc(42) = ascii('4') * 0 + ascii('2') * 1 = 52 * 0 + 50 * 1 = 50.

Back to listMay 23, 2024 17:31matsuoka-601matsuoka-601Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 23, 2024 17:3100000Error: expected "560376943326 ", got "571923 15625000 8663023837173533060 305 "
2May 23, 2024 17:3200000Error: expected "560370761522 ", got "571629 15625000 -5344284970035030267 290 "
3May 23, 2024 17:4100000Error: expected "560373286628 ", got "572634 15625000 -4306623383955811557 305 "
4May 23, 2024 17:4100000Error: expected "560377927953 ", got "571854 15625000 1583214677069939051 290 "