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 6, 2024 03:27zielajzielajScore: 11,372Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 6, 2024 03:2711,339117,590,20493,113,0001,001,0002,510,848
2Nov 6, 2024 03:2711,351114,888,75993,208,0001,002,0002,420,736
3Nov 6, 2024 03:2711,361115,567,29992,293,0002,006,0002,535,424
4Nov 6, 2024 03:2711,362114,944,54393,300,0001,003,0002,531,328
5Nov 6, 2024 03:2711,364125,451,36692,313,0002,006,0002,535,424
6Nov 6, 2024 03:2711,368118,104,70094,358,00002,510,848
7Nov 6, 2024 03:2711,372121,864,90194,390,00002,535,424
8Nov 6, 2024 03:2711,374121,682,67792,399,0002,008,0002,506,752
9Nov 6, 2024 03:2711,376117,402,59493,418,0001,004,0002,535,424
10Nov 6, 2024 03:2711,376119,098,56993,420,0001,004,0002,535,424
11Nov 6, 2024 03:2711,386117,039,59793,496,0001,005,0002,273,280
12Nov 6, 2024 03:2711,396124,602,55494,588,00002,433,024