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 13, 2024 03:10bgimby-nsbgimby-nsScore: 513,281Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2024 03:10508,5204,289,270,4934,220,713,91602,240,512
2Jul 13, 2024 03:10513,2814,327,649,6364,260,233,16202,240,512
3Jul 13, 2024 03:10513,3554,315,545,1244,260,849,35902,240,512