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 15:47Kevin HeaveyKevin HeaveyScore: 62,702Success
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 15:4961,783312,963,345296,311,0006,430,00020,480
2Jul 27, 2026 15:4961,853313,880,316296,267,0006,816,00020,480
3Jul 27, 2026 15:4961,975314,309,532297,314,0006,366,00020,480
4Jul 27, 2026 15:4962,295315,566,409296,345,0008,905,00020,480
5Jul 27, 2026 15:4962,702318,012,792298,661,0008,582,00020,480
6Jul 27, 2026 15:4963,051319,704,906298,862,00010,088,00020,480
7Jul 27, 2026 15:4963,328320,377,345297,120,00013,189,0002,113,536
8Jul 27, 2026 15:4963,443320,889,364299,419,00011,454,00020,480
9Jul 27, 2026 15:4963,698322,211,026306,079,0006,043,00020,480