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 15, 2025 12:45zielajzielajScore: 38,494Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2025 12:4538,224210,112,926186,296,0001,001,0002,318,336
2Jul 15, 2025 12:4538,225209,688,998187,301,00002,478,080
3Jul 15, 2025 12:4538,226210,244,431187,306,00002,441,216
4Jul 15, 2025 12:4538,458214,476,486188,442,00002,453,504
5Jul 15, 2025 12:4538,494218,896,481187,625,000998,0002,314,240
6Jul 15, 2025 12:4538,538208,149,149185,837,0002,997,0002,318,336
7Jul 15, 2025 12:4538,540209,434,505187,848,000999,0002,535,424
8Jul 15, 2025 12:4538,549216,791,062187,893,000999,0002,469,888
9Jul 15, 2025 12:4538,619207,931,284189,232,00002,289,664