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 18:27Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 01:45Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 01:45044,047,52534,862,0001,227,0002,117,632expected "74600294196621100 ", got "14947970700717868 "
2Jul 7, 2026 01:45043,522,79534,474,0001,136,0002,117,632expected "74600294196621100 ", got "16881282700717868 "
3Jul 7, 2026 01:45043,716,67634,368,0001,123,0002,117,632expected "74600294196621100 ", got "16881282700717868 "
4Apr 13, 2026 18:274,44166,759,39534,867,0001,992,0002,273,280
5Apr 13, 2026 18:274,45758,907,30734,998,0001,999,0002,535,424
6Apr 13, 2026 18:274,46362,045,42435,042,0002,002,0002,535,424