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 31, 2026 22:15Josu San MartinJosu San MartinScore: 36,435Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 22:1636,388188,355,490177,199,0001,107,0002,113,536
2Jul 31, 2026 22:1636,418188,573,427177,339,0001,114,0002,113,536
3Jul 31, 2026 22:1636,422189,297,128177,330,0001,139,0002,113,536
4Jul 31, 2026 22:1636,432189,358,755177,413,0001,104,0002,113,536
5Jul 31, 2026 22:1636,435188,844,568177,429,0001,104,0002,113,536
6Jul 31, 2026 22:1636,438188,617,473177,422,0001,125,0002,113,536
7Jul 31, 2026 22:1636,440188,712,965177,431,0001,127,0002,113,536
8Jul 31, 2026 22:1636,467188,899,510177,574,0001,117,0002,113,536
9Jul 31, 2026 22:1636,471189,620,206177,582,0001,127,0002,113,536