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 29, 2026 03:24Josu San MartinJosu San MartinScore: 24,216Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 03:2424,199127,547,278117,321,0001,258,0002,113,536
2Aug 29, 2026 03:2424,203127,205,424117,327,0001,269,0002,113,536
3Aug 29, 2026 03:2424,208127,032,847117,378,0001,242,0002,113,536
4Aug 29, 2026 03:2424,215127,116,790117,643,0001,013,0002,113,536
5Aug 29, 2026 03:2424,216127,172,621117,416,0001,247,0002,113,536
6Aug 29, 2026 03:2424,251127,252,107117,646,0001,184,0002,113,536
7Aug 29, 2026 03:2424,255127,287,456117,661,0001,191,0002,113,536
8Aug 29, 2026 03:2424,265127,354,146117,653,0001,247,0002,113,536
9Aug 29, 2026 03:2426,780140,842,062129,975,0001,248,0002,113,536