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 5, 2026 14:42Josu San MartinJosu San MartinScore: 27,100Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 5, 2026 14:4326,991140,757,953130,994,0001,264,0002,113,536
2Aug 5, 2026 14:4327,076141,106,976131,498,0001,178,0002,113,536
3Aug 5, 2026 14:4327,091141,257,945131,743,0001,005,0002,113,536
4Aug 5, 2026 14:4327,096141,275,476131,518,0001,255,0002,113,536
5Aug 5, 2026 14:4327,100141,173,618131,547,0001,246,0002,113,536
6Aug 5, 2026 14:4327,110141,342,532131,586,0001,253,0002,113,536
7Aug 5, 2026 14:4327,116141,314,437131,703,0001,170,0002,113,536
8Aug 5, 2026 14:4327,147141,548,025131,845,0001,179,0002,113,536
9Aug 5, 2026 14:4327,151141,413,832131,779,0001,261,0002,113,536