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 listFeb 25, 2024 05:30sliceteamsliceteamScore: 20,377Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 25, 2024 05:3020,144188,680,946164,191,0003,003,0002,416,640
2Feb 25, 2024 05:3020,163187,433,745164,350,0003,006,0002,514,944
3Feb 25, 2024 05:3020,237194,912,393163,972,0003,999,0002,277,376
4Feb 25, 2024 05:3020,241198,955,867163,003,0005,000,0002,363,392
5Feb 25, 2024 05:3020,298198,296,694165,465,0003,008,0002,420,736
6Feb 25, 2024 05:3020,330191,694,238159,751,0008,985,0002,293,760
7Feb 25, 2024 05:3020,377195,649,048166,126,0003,002,0002,400,256
8Feb 25, 2024 05:3020,475195,131,275165,946,0003,998,0002,342,912
9Feb 25, 2024 05:3020,688197,436,920166,720,0004,991,0002,428,928
10Feb 25, 2024 05:3020,782223,709,529172,487,46002,318,336
11Feb 25, 2024 05:3020,836238,012,082172,935,23902,269,184
12Feb 25, 2024 05:3020,868238,481,417173,204,54902,273,280