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 listOct 12, 2026 20:49Karthik ReddyKarthik ReddyScore: 23,807Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 20:5023,762125,380,652115,384,0001,054,00020,480
2Oct 12, 2026 20:5023,771125,513,921115,413,0001,068,00020,480
3Oct 12, 2026 20:5023,803125,584,905115,577,0001,062,00020,480
4Oct 12, 2026 20:5023,805125,549,606115,500,0001,145,00020,480
5Oct 12, 2026 20:5023,807125,553,779115,559,0001,098,00020,480
6Oct 12, 2026 20:5023,810125,609,269115,593,0001,076,00020,480
7Oct 12, 2026 20:5023,822125,602,980115,657,0001,071,00020,480
8Oct 12, 2026 20:5023,843125,775,987115,771,0001,063,00020,480
9Oct 12, 2026 20:5023,903126,380,242116,017,0001,108,00020,480