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 2, 2026 07:46A_ShamanA_ShamanScore: 210,047Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 07:47209,0031,033,785,4681,021,917,0002,200,0002,113,536
2Jul 2, 2026 07:47209,2131,035,307,6621,022,901,0002,246,0002,113,536
3Jul 2, 2026 07:47209,5141,036,224,3141,024,617,0002,004,0002,113,536
4Jul 2, 2026 07:47209,9071,038,616,2891,026,433,0002,116,0002,113,536
5Jul 2, 2026 07:47210,0471,039,790,9611,027,111,0002,122,0002,113,536
6Jul 2, 2026 07:47210,1621,040,720,8221,027,659,0002,135,0002,113,536
7Jul 2, 2026 07:47212,1481,049,490,1701,037,254,0002,276,0002,113,536
8Jul 2, 2026 07:47212,1971,049,813,8171,037,610,0002,159,0002,113,536
9Jul 2, 2026 07:47212,2851,049,962,3251,038,128,0002,071,0002,113,536