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 3, 2024 21:01Sergei YakovlevSergei YakovlevScore: 64,228Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2024 21:0164,170561,485,217481,649,00050,962,0002,277,376
2Nov 3, 2024 21:0164,171559,608,825481,656,00050,963,0002,277,376
3Nov 3, 2024 21:0164,214555,799,337482,981,00049,998,0002,277,376
4Nov 3, 2024 21:0164,220555,861,542482,022,00051,002,0002,277,376
5Nov 3, 2024 21:0164,228560,654,190473,084,00060,010,0002,392,064
6Nov 3, 2024 21:0164,229555,266,485482,094,00051,010,0002,277,376
7Nov 3, 2024 21:0164,231556,150,975479,103,00054,011,0002,400,256
8Nov 3, 2024 21:0164,235560,893,488480,139,00053,015,0002,277,376
9Nov 3, 2024 21:0164,346556,874,138494,064,00040,005,0002,269,184