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 17, 2026 17:23Charles CabergsCharles CabergsScore: 450,004Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2026 17:23449,9282,235,289,2852,202,651,0001,998,0002,277,376
2Apr 17, 2026 17:23449,9582,231,818,8152,201,794,0002,998,0002,277,376
3Apr 17, 2026 17:23449,9762,236,313,5712,201,883,0002,998,0002,277,376
4Apr 17, 2026 17:23449,9952,240,526,7722,200,978,0003,998,0002,404,352
5Apr 17, 2026 17:23450,0042,232,247,7722,203,020,0001,999,0002,277,376
6Apr 17, 2026 17:23450,0082,230,742,6252,202,043,0002,998,0002,277,376
7Apr 17, 2026 17:23450,0312,234,812,0532,202,155,0002,998,0002,277,376
8Apr 17, 2026 17:23450,0712,232,684,8792,202,348,0002,999,0002,412,544
9Apr 17, 2026 17:23450,2542,230,265,7192,202,249,0003,996,0002,412,544