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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 03:0328,989150,551,694140,773,0001,274,0002,113,536
2Aug 3, 2026 03:0328,997151,123,262140,828,0001,259,0002,113,536
3Aug 3, 2026 03:0329,000151,229,148140,826,0001,276,0002,113,536
4Aug 3, 2026 03:0329,007151,115,484140,873,0001,264,0002,113,536
5Aug 3, 2026 03:0329,009150,402,888140,890,0001,257,0002,113,536
6Aug 3, 2026 03:0329,010150,618,589140,878,0001,273,0002,113,536
7Aug 3, 2026 03:0329,020150,604,755141,025,0001,175,0002,113,536
8Aug 3, 2026 03:0329,050151,445,532141,340,0001,008,0002,113,536
9Aug 3, 2026 03:0329,054156,092,779141,342,0001,025,0002,113,536