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 03:13Josu San MartinJosu San MartinScore: 27,993Success
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 03:1327,964145,465,817135,764,0001,261,0002,113,536
2Aug 4, 2026 03:1327,970145,238,210135,778,0001,276,0002,113,536
3Aug 4, 2026 03:1327,984145,251,632135,859,0001,263,0002,113,536
4Aug 4, 2026 03:1327,986145,590,359135,877,0001,257,0002,113,536
5Aug 4, 2026 03:1327,993145,612,746135,983,0001,184,0002,113,536
6Aug 4, 2026 03:1327,995145,603,643135,932,0001,247,0002,113,536
7Aug 4, 2026 03:1328,086146,148,692136,346,0001,279,0002,113,536
8Aug 4, 2026 03:1328,151146,531,459136,904,0001,039,0002,113,536
9Aug 4, 2026 03:1328,234146,785,021137,298,0001,050,0002,113,536