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 listJun 6, 2026 19:42Victor MerckléVictor MerckléScore: 56,337Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 19:4356,201284,530,924273,232,0002,154,0002,113,536
2Jun 6, 2026 19:4356,287286,493,301273,644,0002,163,0002,113,536
3Jun 6, 2026 19:4356,299284,991,398273,668,0002,198,0002,113,536
4Jun 6, 2026 19:4356,301285,082,508273,688,0002,188,0002,113,536
5Jun 6, 2026 19:4356,337285,294,671274,043,0002,012,0002,113,536
6Jun 6, 2026 19:4356,341285,242,789273,860,0002,212,0002,113,536
7Jun 6, 2026 19:4356,360285,287,592273,946,0002,218,0002,113,536
8Jun 6, 2026 19:4356,384285,536,627274,062,0002,224,0002,113,536
9Jun 6, 2026 19:4356,398285,498,305274,130,0002,224,0002,113,536