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 4, 2026 16:40Josu San MartinJosu San MartinScore: 25,164Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 16:4025,141132,266,184121,919,0001,273,0002,113,536
2Aug 4, 2026 16:4025,147132,167,180121,953,0001,268,0002,113,536
3Aug 4, 2026 16:4025,147131,675,988121,972,0001,253,0002,113,536
4Aug 4, 2026 16:4025,154132,305,406121,999,0001,258,0002,113,536
5Aug 4, 2026 16:4025,164131,738,574122,274,0001,031,0002,113,536
6Aug 4, 2026 16:4025,190133,253,811122,174,0001,261,0002,113,536
7Aug 4, 2026 16:4025,190131,813,362122,155,0001,278,0002,113,536
8Aug 4, 2026 16:4025,256132,227,204122,751,0001,007,0002,113,536
9Aug 4, 2026 16:4025,527133,523,406123,819,0001,267,0002,113,536