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 listOct 24, 2026 04:02Nao MinamiNao MinamiScore: 55,287Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 24, 2026 04:0255,115470,432,961395,306,00062,155,0002,113,536
2Oct 24, 2026 04:0255,187468,923,710396,409,00061,644,0002,113,536
3Oct 24, 2026 04:0255,210469,051,329396,249,00061,998,0002,113,536
4Oct 24, 2026 04:0255,229469,237,592396,608,00061,794,0002,113,536
5Oct 24, 2026 04:0255,287469,810,891396,016,00062,870,0002,113,536
6Oct 24, 2026 04:0255,298469,801,822396,820,00062,154,0002,113,536
7Oct 24, 2026 04:0255,326469,986,931396,335,00062,877,0002,113,536
8Oct 24, 2026 04:0255,359470,367,734397,306,00062,174,0002,113,536
9Oct 24, 2026 04:0255,435470,945,009396,910,00063,206,0002,113,536