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 listSep 3, 2026 20:29Victor MerckléVictor MerckléScore: 3,699Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 20:303,66338,841,72129,340,0001,064,0002,113,536
2Sep 3, 2026 20:303,68238,970,85029,409,0001,159,0002,113,536
3Sep 3, 2026 20:303,68939,019,64429,538,0001,088,0002,113,536
4Sep 3, 2026 20:303,69639,837,38029,532,0001,151,0002,113,536
5Sep 3, 2026 20:303,69939,120,79629,570,0001,139,0002,113,536
6Sep 3, 2026 20:303,70039,163,45129,610,0001,108,0002,113,536
7Sep 3, 2026 20:303,70239,229,41529,589,0001,145,0002,113,536
8Sep 3, 2026 20:303,71939,310,11429,719,0001,155,0002,113,536
9Sep 3, 2026 20:303,76241,071,48530,081,0001,147,0002,113,536