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 listFeb 24, 2026 18:49Daniel MastalerzDaniel MastalerzScore: 5,597Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 18:495,50074,491,72742,605,0003,043,0002,326,528
2Feb 24, 2026 18:495,52276,285,73942,847,0002,989,0002,269,184
3Feb 24, 2026 18:495,58871,070,09543,359,0003,025,0002,306,048
4Feb 24, 2026 18:495,59773,799,60843,423,0003,029,0002,519,040
5Feb 24, 2026 18:495,67570,784,56443,093,0004,008,0002,310,144
6Feb 24, 2026 18:495,76375,640,05544,846,0002,989,0002,318,336