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 9, 2026 08:59Karthik ReddyKarthik ReddyScore: 23,797Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 10:0323,741125,343,577115,275,0001,059,00020,480
2Oct 9, 2026 10:0323,767125,420,198115,408,0001,053,00020,480
3Oct 9, 2026 10:0323,777125,464,403115,445,0001,066,00020,480
4Oct 9, 2026 10:0323,796125,567,989115,527,0001,077,00020,480
5Oct 9, 2026 10:0323,797125,569,504115,559,0001,051,00020,480
6Oct 9, 2026 10:0323,803125,653,139115,570,0001,068,00020,480
7Oct 9, 2026 10:0323,832125,785,416115,717,0001,062,00020,480
8Oct 9, 2026 10:0323,836125,648,823115,740,0001,059,00020,480
9Oct 9, 2026 10:0323,853125,826,089115,834,0001,049,00020,480