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 1, 2026 10:56George SeabridgeGeorge SeabridgeScore: 7,768Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 10:567,74874,330,45363,220,0001,094,0002,113,536
2Aug 1, 2026 10:567,75274,297,08963,250,0001,092,0002,113,536
3Aug 1, 2026 10:567,75574,354,22963,287,0001,084,0002,113,536
4Aug 1, 2026 10:567,76674,424,52163,382,0001,076,0002,113,536
5Aug 1, 2026 10:567,76874,462,56563,391,0001,087,0002,113,536
6Aug 1, 2026 10:567,77974,978,92663,484,0001,086,0002,113,536
7Aug 1, 2026 10:567,78774,607,50863,544,0001,092,0002,113,536
8Aug 1, 2026 10:567,83775,132,66364,036,0001,012,0002,113,536
9Aug 1, 2026 10:567,87375,507,71064,270,0001,084,0002,113,536