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 09:12Josu San MartinJosu San MartinScore: 30,951Success
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 09:1230,888161,389,171150,218,0001,134,0002,113,536
2Aug 3, 2026 09:1230,895161,487,192150,270,0001,116,0002,113,536
3Aug 3, 2026 09:1230,930162,409,447150,425,0001,135,0002,113,536
4Aug 3, 2026 09:1230,930162,353,161150,438,0001,121,0002,113,536
5Aug 3, 2026 09:1230,951162,471,042150,533,0001,131,0002,113,536
6Aug 3, 2026 09:1230,961162,403,519150,562,0001,147,0002,113,536
7Aug 3, 2026 09:1231,275163,331,021152,126,0001,122,0002,113,536
8Aug 3, 2026 09:1231,731165,454,967154,366,0001,118,0002,113,536
9Aug 3, 2026 09:1231,839165,985,431154,908,0001,104,0002,113,536