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 20:41anboto1anboto1Score: 158,708Success
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 20:41158,414786,181,858774,922,0001,309,0002,113,536
2Jul 31, 2026 20:41158,433786,513,765775,016,0001,310,0002,113,536
3Jul 31, 2026 20:41158,472786,619,331775,199,0001,315,0002,113,536
4Jul 31, 2026 20:41158,521786,742,927775,442,0001,315,0002,113,536
5Jul 31, 2026 20:41158,708787,709,161776,360,0001,313,0002,113,536
6Jul 31, 2026 20:41158,712787,798,653776,304,0001,386,0002,113,536
7Jul 31, 2026 20:41158,714787,698,490776,378,0001,323,0002,113,536
8Jul 31, 2026 20:41158,942788,882,377777,512,0001,306,0002,113,536
9Jul 31, 2026 20:41159,210790,203,704778,804,0001,327,0002,113,536