Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listMay 23, 2026 23:17Victor MerckléVictor MerckléScore: 20,602Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 23, 2026 23:1820,577179,946,242169,714,0001,081,0002,113,536
2May 23, 2026 23:1820,586178,794,948169,717,0001,151,0002,113,536
3May 23, 2026 23:1820,589180,722,207169,823,0001,073,0002,113,536
4May 23, 2026 23:1820,595179,122,208169,877,0001,068,0002,113,536
5May 23, 2026 23:1820,602178,957,017169,926,0001,076,0002,113,536
6May 23, 2026 23:1820,611178,925,707170,011,0001,067,0002,113,536
7May 23, 2026 23:1820,612179,239,430170,077,0001,005,0002,113,536
8May 23, 2026 23:1820,661179,274,307170,494,0001,000,0002,113,536
9May 23, 2026 23:1820,982184,239,362173,088,0001,070,0002,113,536