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 listOct 9, 2023 13:08Serge SmirnovSerge SmirnovScore: 39,220Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2023 13:0939,204384,114,310325,390,03202,293,760
2Oct 9, 2023 13:0939,209387,203,033325,432,89702,281,472
3Oct 9, 2023 13:0839,217389,266,032325,498,97702,285,568
4Oct 9, 2023 13:0839,220390,874,870325,522,38302,277,376
5Oct 9, 2023 13:0839,220391,341,317325,522,39202,289,664
6Oct 9, 2023 13:0939,230387,192,813325,605,83502,281,472
7Oct 9, 2023 13:0839,256390,755,807325,825,83302,277,376
8Oct 9, 2023 13:0839,265392,102,931325,895,87702,297,856
9Oct 9, 2023 13:0839,276393,569,647325,991,39902,285,568