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 2, 2026 15:15Josu San MartinJosu San MartinScore: 31,145Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 15:1631,112162,453,338151,316,0001,134,0002,113,536
2Aug 2, 2026 15:1631,132163,324,425151,428,0001,122,0002,113,536
3Aug 2, 2026 15:1631,135162,716,784151,437,0001,127,0002,113,536
4Aug 2, 2026 15:1631,140163,458,348151,455,0001,134,0002,113,536
5Aug 2, 2026 15:1631,145162,641,290151,495,0001,120,0002,113,536
6Aug 2, 2026 15:1631,147162,523,116151,499,0001,123,0002,113,536
7Aug 2, 2026 15:1631,160162,717,914151,558,0001,128,0002,113,536
8Aug 2, 2026 15:1631,183163,706,710151,685,0001,114,0002,113,536
9Aug 2, 2026 15:1631,811166,553,075154,757,0001,117,0002,113,536