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 29, 2024 17:34Matt StuchlikMatt StuchlikScore: 55,875Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 29, 2024 17:3455,827524,820,912463,362,17402,269,184
2Feb 29, 2024 17:3355,843526,325,725463,496,79502,269,184
3Feb 29, 2024 17:3355,845521,429,649463,511,14002,269,184
4Feb 29, 2024 17:3455,859535,869,309463,633,59102,252,800
5Feb 29, 2024 17:3455,875529,977,794463,765,65202,252,800
6Feb 29, 2024 17:3355,895531,569,222463,927,43102,260,992
7Feb 29, 2024 17:3455,897521,663,761463,944,09902,265,088
8Feb 29, 2024 17:3455,946530,642,025464,348,47102,260,992
9Feb 29, 2024 17:3457,198544,854,364474,742,26202,252,800