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 listJul 7, 2026 12:16Victor MerckléVictor MerckléScore: 4,127Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 14:53wn10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 12:174,09341,957,78632,934,0001,043,0002,117,632stderr
2Jul 7, 2026 12:174,11642,091,83633,091,0001,074,0002,117,632stderr
3Jul 7, 2026 12:174,11642,225,53333,027,0001,137,0002,117,632stderr
4Jul 7, 2026 12:174,11742,123,18133,152,0001,022,0002,117,632stderr
5Jul 7, 2026 12:174,12742,365,88633,213,0001,049,0002,117,632stderr
6Jul 7, 2026 12:174,13542,354,40633,310,0001,017,0002,117,632stderr
7Jul 7, 2026 12:174,14442,481,38633,359,0001,044,0002,117,632stderr
8Jul 7, 2026 12:174,16542,557,61533,517,0001,054,0002,117,632stderr
9Jul 7, 2026 12:174,16542,605,08033,552,0001,022,0002,117,632stderr