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 listNov 17, 2024 15:59Ilango RajagopalIlango RajagopalScore: 76,256Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 17, 2024 15:5976,063654,586,979451,513,000179,806,0002,461,696
2Nov 17, 2024 15:5976,256654,658,696451,949,000180,979,0002,469,888
3Nov 17, 2024 15:5977,740672,098,227462,459,000182,786,0002,326,528