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 27, 2026 13:30Kevin HeaveyKevin HeaveyScore: 53,206Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2026 13:3852,866269,235,993249,470,0009,575,00020,480
2Jul 27, 2026 13:3852,921270,343,759248,931,00010,384,00020,480
3Jul 27, 2026 13:3852,982269,719,853249,257,00010,357,00020,480
4Jul 27, 2026 13:3853,097270,306,602249,035,00011,145,00020,480
5Jul 27, 2026 13:3853,206270,830,205249,388,00011,323,00020,480
6Jul 27, 2026 13:3853,271271,145,311248,994,00012,035,00020,480
7Jul 27, 2026 13:3853,373272,354,888249,308,00012,223,00020,480
8Jul 27, 2026 13:3853,483272,302,891249,254,00012,817,00020,480
9Jul 27, 2026 13:3853,558272,549,903249,883,00012,556,00020,480