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 14, 2026 09:31Victor MerckléVictor MerckléScore: 67,806Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 09:3167,753570,014,815561,353,0001,001,0002,117,632stderr
2May 14, 2026 09:3167,786570,804,637561,625,0001,002,0002,117,632stderr
3May 14, 2026 09:3167,792572,723,296561,676,0001,002,0002,117,632stderr
4May 14, 2026 09:3167,805570,600,675561,786,0001,003,0002,117,632stderr
5May 14, 2026 09:3167,806570,144,561561,796,0001,001,0002,117,632stderr
6May 14, 2026 09:3167,808572,570,176561,811,0001,001,0002,117,632stderr
7May 14, 2026 09:3167,821571,809,407561,920,0001,001,0002,117,632stderr
8May 14, 2026 09:3167,823572,789,392561,935,0001,002,0002,117,632stderr
9May 14, 2026 09:3167,826571,515,002561,956,0001,001,0002,117,632stderr