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 28, 2026 16:33C#_userC#_userError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 16:3401,007,687,110877,783,000120,160,0002,142,208expected "560379861934 ", got "468824837643 "
2Aug 28, 2026 16:3401,012,616,650880,725,000121,767,0002,142,208expected "560373072406 ", got "468821042160 "
3Aug 28, 2026 16:3401,008,861,613878,746,000120,395,0002,203,648expected "560371866990 ", got "468820321893 "