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 listApr 28, 2024 15:22Steve HanSteve HanScore: 20,737Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2024 15:2720,656240,907,439171,441,94302,174,976
2Apr 28, 2024 15:2220,680229,834,968171,645,30102,297,856
3Apr 28, 2024 15:2220,715234,406,569171,936,56802,301,952
4Apr 28, 2024 15:2720,728219,948,940172,040,03902,301,952
5Apr 28, 2024 15:2220,737235,870,842172,115,80902,297,856
6Apr 28, 2024 15:2221,796246,325,269180,905,59702,174,976
7Apr 28, 2024 15:2221,812241,948,950181,043,05702,179,072
8Apr 28, 2024 15:2721,822247,265,236181,123,12602,301,952
9Apr 28, 2024 15:2221,998249,443,439182,585,54602,179,072