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 listApr 13, 2026 19:10Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 01:43Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 01:43043,975,10534,797,0001,226,0002,117,632expected "74600294196621100 ", got "17101192389373740 "
2Jul 7, 2026 01:43043,400,03634,372,0001,127,0002,117,632expected "74600294196621100 ", got "15339584709342744 "
3Jul 7, 2026 01:43043,683,13634,625,0001,173,0002,117,632expected "74600294196621100 ", got "17101192389373740 "
4Apr 13, 2026 19:104,44160,069,47134,869,0001,992,0002,473,984
5Apr 13, 2026 19:104,44866,534,83134,921,0001,995,0002,535,424
6Apr 13, 2026 19:104,45866,554,11135,999,000999,0002,473,984