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 12:43Josu San MartinJosu San MartinScore: 25,486Success
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 12:4425,371132,710,304123,058,0001,264,0002,113,536
2Aug 4, 2026 12:4425,372132,711,534123,132,0001,192,0002,113,536
3Aug 4, 2026 12:4425,376132,648,376123,085,0001,261,0002,113,536
4Aug 4, 2026 12:4425,399132,746,158123,384,0001,072,0002,113,536
5Aug 4, 2026 12:4425,486134,701,347123,703,0001,181,0002,113,536
6Aug 4, 2026 12:4425,535133,525,096124,118,0001,005,0002,113,536
7Aug 4, 2026 12:4425,678134,214,997124,569,0001,256,0002,113,536
8Aug 4, 2026 12:4425,696134,302,752124,769,0001,142,0002,113,536
9Aug 4, 2026 12:4426,002135,840,534126,362,0001,048,0002,113,536