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 12:04Kevin HeaveyKevin HeaveyScore: 66,439Success
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 12:1265,775332,192,557312,101,00010,198,00020,480
2Jul 27, 2026 12:1266,261334,449,035312,837,00011,842,00020,480
3Jul 27, 2026 12:1266,316334,816,759314,495,00010,458,00020,480
4Jul 27, 2026 12:1266,415335,170,825313,348,00012,086,00020,480
5Jul 27, 2026 12:1266,439335,431,690312,477,00013,075,00020,480
6Jul 27, 2026 12:1266,471335,521,948312,596,00013,112,00020,480
7Jul 27, 2026 12:1266,535335,911,020313,092,00012,931,00020,480
8Jul 27, 2026 12:1266,602336,241,751313,949,00012,404,00020,480
9Jul 27, 2026 12:1267,087338,670,145314,879,00013,848,0002,113,536