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 30, 2026 20:31Josu San MartinJosu San MartinScore: 4,300Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 20:314,26843,871,65634,402,0001,025,0002,113,536
2Aug 30, 2026 20:314,27843,927,18434,469,0001,044,0002,113,536
3Aug 30, 2026 20:314,28844,004,78634,487,0001,107,0002,113,536
4Aug 30, 2026 20:314,29344,013,46934,520,0001,113,0002,113,536
5Aug 30, 2026 20:314,30044,100,13134,578,0001,117,0002,113,536
6Aug 30, 2026 20:314,30844,224,58134,629,0001,131,0002,113,536
7Aug 30, 2026 20:314,33549,658,52734,876,0001,110,0002,113,536
8Aug 30, 2026 20:314,37353,011,94235,274,0001,025,0002,113,536
9Aug 30, 2026 20:314,37953,279,61135,299,0001,049,0002,113,536