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 listJul 21, 2025 01:08zielajzielajScore: 28,877Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 21, 2025 01:0828,859175,267,272140,409,0001,002,0002,453,504
2Jul 21, 2025 01:0828,862167,632,505141,425,00002,322,432
3Jul 21, 2025 01:0828,863167,249,262141,430,00002,473,984
4Jul 21, 2025 01:0828,869169,469,785141,459,00002,310,144
5Jul 21, 2025 01:0828,877168,185,880140,493,0001,003,0002,482,176
6Jul 21, 2025 01:0828,887172,415,298140,545,0001,003,0002,318,336
7Jul 21, 2025 01:0828,902166,958,420139,624,0001,994,0002,322,432
8Jul 21, 2025 01:0828,927167,486,099141,744,00002,322,432
9Jul 21, 2025 01:0829,016162,504,027140,175,0002,002,0002,318,336