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 listDec 26, 2023 09:54matsuoka-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
1Dec 26, 2023 09:5400000Error: expected "560377708911 ", got "-3457128199439821434 6193145287147741 5752578513386398215 0 0 0 280 149 168 "
2Dec 26, 2023 09:5600000Error: expected "560378878898 ", got "6461764396711424768 61925353882058963 -8534531004723756893 0 0 0 283 120 176 "
3Dec 26, 2023 09:5600000Error: expected "560376073517 ", got "6754074455552005103 1689897848733716 -1834899490880922474 0 0 0 283 154 159 "