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 listAug 28, 2026 23:41Josu San MartinJosu San MartinScore: 25,073Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 23:4225,061131,199,877121,543,0001,258,0002,113,536
2Aug 28, 2026 23:4225,065131,175,080121,564,0001,256,0002,113,536
3Aug 28, 2026 23:4225,069131,265,913121,578,0001,262,0002,113,536
4Aug 28, 2026 23:4225,070131,209,185121,582,0001,261,0002,113,536
5Aug 28, 2026 23:4225,073131,280,724121,591,0001,271,0002,113,536
6Aug 28, 2026 23:4225,074131,266,935121,597,0001,270,0002,113,536
7Aug 28, 2026 23:4225,075131,260,700121,601,0001,268,0002,113,536
8Aug 28, 2026 23:4225,664134,156,697124,493,0001,261,0002,113,536
9Aug 28, 2026 23:4225,698134,301,602124,672,0001,251,0002,113,536