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, 2025 05:48RyhbtRyhbtScore: 72,307Success
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, 2025 05:4872,283624,050,022597,950,0001,999,0002,502,656
2Aug 7, 2025 05:4872,292625,260,796598,023,0002,000,0002,502,656
3Aug 7, 2025 05:4872,296628,163,435598,060,0002,000,0002,281,472
4Aug 7, 2025 05:4872,299630,606,249596,083,0004,000,0002,510,848
5Aug 7, 2025 05:4872,307621,423,934597,149,0003,000,0002,281,472
6Aug 7, 2025 05:4872,310623,661,371598,170,0002,000,0002,510,848
7Aug 7, 2025 05:4872,337624,756,644599,399,000998,0002,277,376
8Aug 7, 2025 05:4872,356627,690,937598,557,0001,998,0002,334,720
9Aug 7, 2025 05:4872,481621,733,330598,595,0002,997,0002,281,472