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 16:12anboto1anboto1Score: 70,056Success
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 16:1369,877353,242,627341,286,0001,113,0002,113,536
2Aug 2, 2026 16:1369,928352,701,192341,532,0001,118,0002,113,536
3Aug 2, 2026 16:1369,976352,914,003341,771,0001,112,0002,113,536
4Aug 2, 2026 16:1370,004353,078,071341,894,0001,129,0002,113,536
5Aug 2, 2026 16:1370,056353,409,567342,170,0001,106,0002,113,536
6Aug 2, 2026 16:1370,067353,343,667342,205,0001,128,0002,113,536
7Aug 2, 2026 16:1370,077354,159,609342,235,0001,144,0002,113,536
8Aug 2, 2026 16:1370,216355,518,494342,936,0001,123,0002,113,536
9Aug 2, 2026 16:1370,226354,138,174342,989,0001,120,0002,113,536