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 3, 2026 21:12anboto1anboto1Score: 57,695Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 21:1357,554291,072,612280,914,0001,105,0002,113,536
2Aug 3, 2026 21:1357,557291,053,636280,930,0001,104,0002,113,536
3Aug 3, 2026 21:1357,579291,179,804281,054,0001,085,0002,113,536
4Aug 3, 2026 21:1357,581291,233,866281,023,0001,124,0002,113,536
5Aug 3, 2026 21:1357,695291,795,901281,615,0001,093,0002,113,536
6Aug 3, 2026 21:1357,698291,924,723281,528,0001,194,0002,113,536
7Aug 3, 2026 21:1357,740291,942,695281,774,0001,152,0002,113,536
8Aug 3, 2026 21:1357,792291,582,762282,079,0001,102,0002,113,536
9Aug 3, 2026 21:1358,480296,390,876285,448,0001,105,0002,113,536