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 2, 2026 20:56George SeabridgeGeorge SeabridgeScore: 5,605Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 20:565,56856,103,18243,962,0002,257,0002,113,536
2Aug 2, 2026 20:565,58456,291,66344,106,0002,249,0002,113,536
3Aug 2, 2026 20:565,58856,270,56044,107,0002,281,0002,113,536
4Aug 2, 2026 20:565,59156,394,64344,140,0002,272,0002,113,536
5Aug 2, 2026 20:565,60556,468,83644,223,0002,301,0002,113,536
6Aug 2, 2026 20:565,63856,666,22044,519,0002,280,0002,113,536
7Aug 2, 2026 20:565,64457,589,31344,589,0002,263,0002,113,536
8Aug 2, 2026 20:565,65757,176,53744,635,0002,323,0002,113,536
9Aug 2, 2026 20:565,68857,578,75644,943,0002,273,0002,113,536