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 listAug 3, 2026 21:29anboto1anboto1Score: 57,618Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 21:3057,575291,133,136281,038,0001,082,0002,113,536
2Aug 3, 2026 21:3057,582290,684,582281,022,0001,130,0002,113,536
3Aug 3, 2026 21:3057,600291,766,977281,150,0001,094,0002,113,536
4Aug 3, 2026 21:3057,607290,738,513281,177,0001,099,0002,113,536
5Aug 3, 2026 21:3057,618291,473,261281,245,0001,086,0002,113,536
6Aug 3, 2026 21:3057,621292,070,679281,246,0001,097,0002,113,536
7Aug 3, 2026 21:3057,755292,231,732281,904,0001,097,0002,113,536
8Aug 3, 2026 21:3057,769292,186,997281,911,0001,159,0002,113,536
9Aug 3, 2026 21:3059,175298,985,314288,869,0001,091,0002,113,536