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 listJul 19, 2022 09:12spire-ffostonspire-ffostonScore: 382,114Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 19, 2022 09:12379,8813,219,470,4263,153,015,94402,191,360
2Jul 19, 2022 09:12382,1143,241,634,7303,171,547,98502,195,456
3Jul 19, 2022 09:12383,3363,248,711,5863,181,685,41402,191,360