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 listSep 11, 2026 08:11C#_userC#_userScore: 192,288Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2026 08:11190,970946,235,967820,316,000115,437,0002,113,536
2Sep 11, 2026 08:11191,024946,490,600819,993,000116,027,0002,113,536
3Sep 11, 2026 08:11191,335947,922,859820,608,000116,938,0002,113,536
4Sep 11, 2026 08:11191,684950,331,600823,236,000116,019,0002,113,536
5Sep 11, 2026 08:11192,288952,633,346820,669,000121,543,00020,480
6Sep 11, 2026 08:11192,807955,141,839828,044,000116,714,0002,113,536
7Sep 11, 2026 08:11193,273957,516,972824,458,000122,581,00020,480
8Sep 11, 2026 08:11193,710959,980,149824,121,000125,062,00020,480
9Sep 11, 2026 08:11196,937976,124,279848,971,000116,022,0002,113,536