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 listApr 3, 2026 14:40limanjun99limanjun99Score: 136,829Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 3, 2026 14:40136,810695,237,247668,371,0001,998,0002,277,376
2Apr 3, 2026 14:40136,814696,619,585667,393,0002,997,0002,285,568
3Apr 3, 2026 14:40136,819695,272,826667,416,0002,997,0002,265,088
4Apr 3, 2026 14:40136,821692,172,513668,426,0001,998,0002,277,376
5Apr 3, 2026 14:40136,829693,601,272668,462,0001,998,0002,289,664
6Apr 3, 2026 14:40136,832694,401,549667,482,0002,997,0002,371,584
7Apr 3, 2026 14:40136,866692,692,043667,645,0002,998,0002,293,760
8Apr 3, 2026 14:40136,875696,715,515667,688,0002,998,0002,293,760
9Apr 3, 2026 14:40136,894698,475,326667,783,0002,999,0002,293,760