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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 03:0924,775129,770,137120,147,0001,254,0002,113,536
2Aug 29, 2026 03:0924,778130,013,922120,157,0001,259,0002,113,536
3Aug 29, 2026 03:0924,785129,899,366120,200,0001,251,0002,113,536
4Aug 29, 2026 03:0924,802129,912,735120,272,0001,259,0002,113,536
5Aug 29, 2026 03:0924,807129,928,009120,300,0001,255,0002,113,536
6Aug 29, 2026 03:0924,842130,122,920120,469,0001,260,0002,113,536
7Aug 29, 2026 03:0924,928130,538,121120,884,0001,264,0002,113,536
8Aug 29, 2026 03:0924,954130,715,555121,014,0001,265,0002,113,536
9Aug 29, 2026 03:0924,977131,419,577121,141,0001,248,0002,113,536