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 2, 2026 14:17anboto1anboto1Score: 111,591Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 14:18111,299555,412,705544,141,0001,227,0002,113,536
2Aug 2, 2026 14:18111,382555,796,918544,543,0001,230,0002,113,536
3Aug 2, 2026 14:18111,385556,227,631544,543,0001,245,0002,113,536
4Aug 2, 2026 14:18111,496556,434,764545,098,0001,237,0002,113,536
5Aug 2, 2026 14:18111,591556,921,173545,594,0001,202,0002,113,536
6Aug 2, 2026 14:18111,689558,066,299546,037,0001,241,0002,113,536
7Aug 2, 2026 14:18112,517561,379,278550,101,0001,235,0002,113,536
8Aug 2, 2026 14:18112,933563,566,566552,125,0001,251,0002,113,536
9Aug 2, 2026 14:18112,958563,523,357552,272,0001,227,0002,113,536