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 23:54Josu San MartinJosu San MartinScore: 31,667Success
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 23:5431,660163,490,261153,856,0001,280,0002,113,536
2Aug 2, 2026 23:5431,662163,514,763154,139,0001,006,0002,113,536
3Aug 2, 2026 23:5431,662163,570,235154,124,0001,020,0002,113,536
4Aug 2, 2026 23:5431,663163,484,523154,128,0001,022,0002,113,536
5Aug 2, 2026 23:5431,667163,542,261154,147,0001,022,0002,113,536
6Aug 2, 2026 23:5431,681163,643,304154,203,0001,036,0002,113,536
7Aug 2, 2026 23:5431,687163,623,362154,002,0001,269,0002,113,536
8Aug 2, 2026 23:5432,197166,197,060156,755,0001,011,0002,113,536
9Aug 2, 2026 23:5434,112175,466,679166,142,0001,007,0002,113,536