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 listAug 26, 2026 21:05Victor MerckléVictor MerckléScore: 4,295Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 21:054,17042,756,90633,478,0001,137,0002,113,536
2Aug 26, 2026 21:054,18243,730,29933,579,0001,137,0002,113,536
3Aug 26, 2026 21:054,19143,823,01233,662,0001,124,0002,113,536
4Aug 26, 2026 21:054,25244,456,16334,159,0001,140,0002,113,536
5Aug 26, 2026 21:054,29544,756,87334,513,0001,139,0002,113,536
6Aug 26, 2026 21:054,32144,204,04034,734,0001,131,0002,113,536
7Aug 26, 2026 21:054,37444,602,04335,291,0001,020,0002,113,536
8Aug 26, 2026 21:054,40744,928,72835,443,0001,142,0002,113,536
9Aug 26, 2026 21:054,52045,916,49436,504,0001,014,0002,113,536