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 listMay 12, 2026 14:00wnwnError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 14:000743,097,125730,588,0002,215,0002,113,536expected "560379877821 ", got "32488675090756 "
2May 12, 2026 14:000740,216,035730,934,0002,006,0002,113,536expected "560379798215 ", got "32512286280829 "
3May 12, 2026 14:000742,411,877730,847,0002,018,0002,113,536expected "560373551301 ", got "32471057685600 "