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:53Karthik ReddyKarthik ReddyScore: 23,805Success
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:5323,774125,354,830115,437,0001,060,00020,480
2Oct 12, 2026 20:5323,775125,423,701115,410,0001,091,00020,480
3Oct 12, 2026 20:5323,792125,272,373115,512,0001,069,00020,480
4Oct 12, 2026 20:5323,801125,580,143115,555,0001,070,00020,480
5Oct 12, 2026 20:5323,805125,546,649115,596,0001,053,00020,480
6Oct 12, 2026 20:5323,813127,651,541115,619,0001,069,00020,480
7Oct 12, 2026 20:5323,821125,668,859115,607,0001,117,00020,480
8Oct 12, 2026 20:5323,834125,759,558115,719,0001,071,00020,480
9Oct 12, 2026 20:5323,896126,087,584115,939,0001,153,00020,480