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 11:44Kevin HeaveyKevin HeaveyScore: 91,142Success
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 11:4690,515453,494,635425,767,00017,759,00020,480
2Jul 27, 2026 11:4691,012455,919,342429,021,00016,938,00020,480
3Jul 27, 2026 11:4691,044456,071,489428,142,00017,977,0002,113,536
4Jul 27, 2026 11:4691,073456,074,166427,448,00018,811,0002,113,536
5Jul 27, 2026 11:4691,142456,465,157426,075,00020,523,00020,480
6Jul 27, 2026 11:4691,286457,128,098426,037,00021,269,00020,480
7Jul 27, 2026 11:4692,572463,550,280427,483,00026,120,0002,113,536
8Jul 27, 2026 11:4692,703464,078,799427,893,00026,352,0002,113,536
9Jul 27, 2026 11:4693,452467,889,157427,690,00030,228,0002,113,536