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 listMar 21, 2026 04:38Josu San MartinJosu San MartinScore: 6,077Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 04:365,71470,327,34347,428,00002,514,944
2Mar 21, 2026 04:385,89170,719,14547,900,000997,0002,355,200
3Mar 21, 2026 04:366,05078,615,50749,212,0001,004,0002,277,376
4Mar 21, 2026 04:386,07796,139,47450,438,00002,277,376
5Mar 21, 2026 04:366,13489,676,83648,917,0001,996,0002,273,280
6Mar 21, 2026 04:386,19389,059,55050,393,0001,007,0002,277,376