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 listJan 11, 2024 05:10Chiraag BaluChiraag BaluScore: 513,532Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2024 05:10513,4754,318,457,8874,261,839,28902,244,608
2Jan 11, 2024 05:11513,4934,322,667,9554,261,993,15902,252,800
3Jan 11, 2024 05:11513,5204,312,768,3764,262,217,66802,260,992
4Jan 11, 2024 05:10513,5324,331,940,1364,262,313,51302,256,896
5Jan 11, 2024 05:11513,5904,333,927,1204,262,796,56702,248,704
6Jan 11, 2024 05:10513,6454,332,290,6974,263,253,53002,260,992