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 listJul 5, 2024 14:21Franek KortaFranek KortaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2024 14:1800000Error: expected "560379781519 ", got "560379781087 "stderr
2Jul 5, 2024 14:21223,5621,163,728,2921,095,454,06302,244,608
3Jul 5, 2024 14:21223,7271,159,823,7901,096,262,54302,236,416
4Jul 5, 2024 14:21224,8011,158,607,9391,101,522,92802,248,704