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 listAug 7, 2026 16:24TonyTonyScore: 6,269Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 7, 2026 16:246,17061,054,20648,813,0002,399,0002,113,536
2Aug 7, 2026 16:246,23461,594,16349,159,0002,587,0002,113,536
3Aug 7, 2026 16:246,25061,697,34249,308,0002,572,0002,113,536
4Aug 7, 2026 16:246,25861,826,72549,368,0002,579,0002,113,536
5Aug 7, 2026 16:246,26961,830,53649,438,0002,601,0002,113,536
6Aug 7, 2026 16:246,28361,992,54349,581,0002,576,0002,113,536
7Aug 7, 2026 16:246,28361,936,45849,596,0002,559,0002,113,536
8Aug 7, 2026 16:246,29262,037,95249,657,0002,570,0002,113,536
9Aug 7, 2026 16:246,33762,485,71650,070,0002,534,0002,113,536