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 15, 2024 20:28Elnur RakhmatullinElnur RakhmatullinScore: 50,451Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2024 20:2850,430446,333,927416,573,0001,997,0002,277,376
2Oct 15, 2024 20:2850,445446,668,957415,700,0002,997,0002,277,376
3Oct 15, 2024 20:2850,448448,172,272415,718,0002,997,0002,277,376
4Oct 15, 2024 20:2850,450443,011,813417,733,000999,0002,531,328
5Oct 15, 2024 20:2850,451449,437,872416,744,0001,998,0002,277,376
6Oct 15, 2024 20:2850,452450,481,788417,756,000999,0002,293,760
7Oct 15, 2024 20:2850,453449,166,050416,765,0001,998,0002,277,376
8Oct 15, 2024 20:2850,455446,573,443415,776,0002,998,0002,277,376
9Oct 15, 2024 20:2850,486446,568,397416,032,0003,000,0002,269,184